1 #include<cstdio> 2  3 #include<cstdlib> 4  5 #include<cmath> 6  7 #include<cstring> 8  9 #include<algorithm>10 11 #include<iostream>12 13 #include<vector>14 15 #include<map>16 17 #include<set>18 19 #include<queue>20 21 #include<string>22 23 #define inf 100000000024 25 #define maxn 100000+526 27 #define maxm 20000000+528 29 #define eps 1e-1030 31 #define ll long long32 33 #define pa pair<int,int>34 35 #define for0(i,n) for(int i=0;i<=(n);i++)36 37 #define for1(i,n) for(int i=1;i<=(n);i++)38 39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)40 41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)42 43 #define mod 100000000744 #define sqr(x) (x)*(x)45 46 using namespace std;47 48 inline int read()49 50 {51 52     int x=0,f=1;char ch=getchar();53 54     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}55 56     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}57 58     return x*f;59 60 }61 int n,m,k,sum,s[maxn],a[maxn],b[maxn],ans[maxn];62 struct rec{int id,l,r;}c[maxn];63 inline void update(int x,int y)64 {65     sum-=sqr(s[x]);66     s[x]+=y;67     sum+=sqr(s[x]);68 }69 inline bool cmp(const rec &x,const rec &y){return b[x.l]==b[y.l]?x.r<y.r:x.l<y.l;}70 71 int main()72 73 {74 75     freopen("input.txt","r",stdin);76 77     freopen("output.txt","w",stdout);78     n=read();m=read();k=read();int len=sqrt(n);79     for1(i,n)a[i]=read(),b[i]=(i-1)/len+1;80     for1(i,m)c[i].l=read(),c[i].r=read(),c[i].id=i;81     sort(c+1,c+m+1,cmp);82     int l=1,r=0;83     for1(i,m)84     {85         while(r<c[i].r)update(a[++r],1);86         while(r>c[i].r)update(a[r--],-1);87         while(l>c[i].l)update(a[--l],1);88         while(l<c[i].l)update(a[l++],-1);89         ans[c[i].id]=sum;90 91     }92     for1(i,m)printf("%d\n",ans[i]);93 94     return 0;95 96 }