B'An array of positive integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an is given. Let us consider its arbitrary subarray al, xe2 x80 x89al xe2 x80 x89+ xe2 x80 x891..., xe2 x80 x89ar, where 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n. 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 xc2 xb7Ks xc2 xb7s 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. First line contains two integers n and t (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89t xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89200000) -- the array length and the number of queries correspondingly. Second line contains n positive integers ai (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106) -- the elements of the array. Next t lines contain two positive integers l, r (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n) each -- the indices of the left and the right ends of the corresponding subarray. 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). Consider the following array (see the second sample) and its [2, 7] subarray (elements of the subarray are colored): '...