Codeforces 86 D.Powerful array（莫队算法）

Powerful array

An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l ≤ r ≤ n. For every positive integer s denote by Ks the number of occurrences of s into the subarray. We call the power of the subarray the sum of products Ks·Ks·s for every positive integer s. The sum contains only finite number of nonzero summands as the number of different values in the array is indeed finite.

You should calculate the power of t given subarrays.

Input

First line contains two integers n and t (1 ≤ n, t ≤ 200000) — the array length and the number of queries correspondingly.

Second line contains n positive integers ai (1 ≤ ai ≤ 106) — the elements of the array.

Next t lines contain two positive integers l, r (1 ≤ l ≤ r ≤ n) each — the indices of the left and the right ends of the corresponding subarray.

Output

Output t lines, the i-th line of the output should contain single positive integer — the power of the i-th query subarray.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preferred to use cout stream (also you may use %I64d).

Examples

Input

3 2
1 2 1
1 2
1 3

Output

3
6

Input

8 3
1 1 2 2 1 3 1 1
2 7
1 6
2 7

Output

20
20
20

Note

Consider the following array (see the second sample) and its [2, 7] subarray (elements of the subarray are colored):

Then K1 = 3, K2 = 2, K3 = 1, so the power is equal to 32·1 + 22·2 + 12·3 = 20.

 

题意：给定一个长度N的数组a，询问区间1<=L<=R<=N中，每个数字出现次数的平方与当前数字的乘积和

思路：莫队裸题。注意的是 add 和 del 时，推一推就有怎么转移了。

设当前数字 a 对 Ans 的贡献为 cnt[a]² * a，当 a 的个数 + 1 时,有 (cnt[a] + 1)² * a，然后化简就有 cnt[a]² * a + a * (2 * cnt[a] + 1)

所以变化的就是后面一半。。。   减同理

Code：

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define fi first
#define se second
#define CLR(a) while(!(a).empty()) a.pop()

using namespace std;

const int maxn = 2e5 + 10;
LL ans[maxn],Ans = 0;
LL cnt[maxn * 6];
int a[maxn],belong[maxn];

struct xx{
    int l,r,id;
}Q[maxn];

inline int read() {
    int X = 0, w = 0;
    char ch = 0;
    while(!isdigit(ch)) {
        w |= ch == '-';
        ch = getchar();
    }
    while(isdigit(ch))
        X = (X << 3) + (X << 1) + (ch ^ 48), ch = getchar();
    return w ? -X : X;
}

int cmp(xx a, xx b) {
    return (belong[a.l] ^ belong[b.l]) ? 
    belong[a.l] < belong[b.l] :
    ((belong[a.l] & 1) ? a.r < b.r : a.r > b.r);
}

void del(int x){
    -- cnt[a[x]];
    Ans -= 1LL * (2 * cnt[a[x]] + 1) * a[x];
}

void add(int x){
    Ans += 1LL * (2 * cnt[a[x]] + 1) * a[x];
    ++ cnt[a[x]];
}

int main() {
//#ifndef ONLINE_JUDGE
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
//#endif
    int n = read(),m = read();
    int block = sqrt(n);
    for(int i = 1;i <= n;++ i){
        a[i] = read();
        belong[i] = (i - 1) / block + 1;
    }
    for(int i = 1;i <= m;++ i){
        Q[i].l = read();
        Q[i].r = read();
        Q[i].id = i;
    }
    sort(Q + 1,Q + 1 + m,cmp);
    int L = 1,R = 0;
    for(int i = 1;i <= m;++ i){
        while(L < Q[i].l) del(L ++);
        while(L > Q[i].l) add(-- L);
        while(R < Q[i].r) add(++ R);
        while(R > Q[i].r) del(R --);
        ans[Q[i].id] = Ans;
    }
    for(int i = 1;i <= m;++ i)
        printf("%lld\n",ans[i]);
    return 0;
}