#include<bits/stdc++.h>
#define N 50005
#define ll long long
using namespace std;
inline ll read(){
	ll x=0,f=1;char c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=x*10+c-'0';c=getchar();}
	return x*f;
}
ll n,m,maxn,q[N],cnt[N],sum,ans[N];
struct query{
	ll l,r,id;
	bool operator<(const query &a)const{
		if(l/maxn!=a.l/maxn)return l<a.l;
		else return (l/maxn)&1?r<a.r:r>a.r;
	}
}a[N];
void add(int i){sum+=2*cnt[i]+1;cnt[i]++;}
void del(int i){cnt[i]--;sum-=2*cnt[i]-1;}
void solve(){
	sort(a+1,a+m+1);for(int i=1,l=1,r=0;i<=m;i++){
		if(a[i].l==a[i].r){ans[a[i].id]=1;continue;}
		while(l>a[i].l)add(q[--l]);
		while(r<a[i].r)add(q[++r]);
		while(l<a[i].l)del(q[l++]);
		while(r>a[i].r)del(q[r--]);
		ans[a[i].id]=sum;
	}
}
int main(){
	n=read(),m=read(),maxn=sqrt(n);
	for(int i=1;i<=n;i++)q[i]=read();
	for(int i=1;i<=m;i++){ll l=read(),r=read();a[i]=(query){l,r,i};}
	solve();for(int i=1;i<=m;i++)printf("%lld\n",ans[i]);
	return 0;
}

希望哪位大佬可以救蒟蒻一把orzorz