#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <iostream>#include <algorithm>#include <queue>#include <set>#include <map>using namespace std;typedef long long ll;#define rep(i, n) for(int i=0; i<(n); ++i)#define for1(i,a,n) for(int i=(a);i<=(n);++i)#define for2(i,a,n) for(int i=(a);i<(n);++i)#define for3(i,a,n) for(int i=(a);i>=(n);--i)#define for4(i,a,n) for(int i=(a);i>(n);--i)#define CC(i,a) memset(i,a,sizeof(i))#define read(a) a=getint()#define print(a) printf("%d", a)#define dbg(x) cout << (#x) << " = " << (x) << endl#define error(x) (!(x)?puts("error"):0)#define rdm(x, i) for(int i=ihead[x]; i; i=e[i].next)inline const int getint() { int r=0, k=1; char c=getchar(); for(; c<‘0‘||c>‘9‘; c=getchar()) if(c==‘-‘) k=-1; for(; c>=‘0‘&&c<=‘9‘; c=getchar()) r=r*10+c-‘0‘; return k*r; }const int N=50005;struct dat { int l, r, id; }q[N];int a[N], n, m, k, pos[N];ll sum, ans[N], s[N];inline bool cmp(const dat &a, const dat &b) { return pos[a.l]==pos[b.l]?a.r<b.r:a.l<b.l; }inline void fix(const int &x, const int &f) {	sum-=s[x]*s[x];	s[x]+=f;	sum+=s[x]*s[x];}void init() {	int sz=sqrt(0.5+n);	for1(i, 1, n) pos[i]=i/sz;	sort(q+1, q+1+m, cmp);}int main() {	read(n); read(m); read(k);	for1(i, 1, n) read(a[i]);	for1(i, 1, m) read(q[i].l), read(q[i].r), q[i].id=i;	init();	int l=1, r=0;	for1(i, 1, m) {		int xl=q[i].l, xr=q[i].r, id=q[i].id;		while(l<xl) fix(a[l++], -1);		while(l>xl) fix(a[--l], 1);		while(r<xr) fix(a[++r], 1);		while(r>xr) fix(a[r--], -1);		ans[id]=sum;	}	for1(i, 1, m) printf("%lld\n", ans[i]);	return 0;}

对于全部的数据，1<=N、M、K<=50000