主题

主题

 
   

D. Powerful array

原题:http://codeforces.com/problemset/problem/86/D

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 productsKs·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. 


题目大意:

给出一个非负整数序列。

定义一个区间的“价值”为区间里面不同数字的“价值”之和。

一个区间中,一个数字的“价值”定义为数字的大小*数字出现次数的平方。

给出m个询问,每一次询问一个区间的“价值”。


个人解法:

莫队维护桶。

写一下式子,看看贡献就可以了。


代码如下:

http://codeforces.com/contest/86/submission/25950140


看到题目旁边贴了四个标签,data structure+two pointer啥的?感觉当时的正解应该很复杂吧……真·莫队强大。

 
 
评论