9 10
6 2 3 1 4 8 5 9 8
3 9
6 6
9 9
9 9
9 9
2 3
3 9
3 8
6 9
5 6
 10 10
5 10 9 2 9 3 5 5 6 5
5 10
2 2
3 10
4 8
1 3
1 5
5 5
10 10
8 9
6 10
 8 10
100 100 100 100 100 100 100 100
1 8
2 8
3 8
4 8
5 8
6 8
7 8
8 8
1 1
1 5
 5 15
103 45 103 67 45
1 1
1 2
1 3
1 4
1 5
2 2
2 3
2 4
2 5
3 3
3 4
3 5
4 4
4 5
5 5
 1 1
1000000
1 1
 10 5
10 9 8 7 6 5 4 3 2 1
4 8
1 10
3 9
2 2
5 10
 9 10
5 3 10 2 4 8 7 5 1
6 9
1 8
3 3
2 7
3 5
4 6
9 9
8 8
1 9
5 6
 9 10
10 2 6 2 4 6 6 4 1
4 8
8 9
2 3
8 9
9 9
4 5
1 7
6 6
6 8
1 1
 20 8
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2
4 15
1 2
2 20
7 7
13 18
7 7
3 19
3 8
 1 2
1
1 1
1 1
 8 10
5 7 3 1 4 2 1 1
5 7
3 8
2 7
4 8
4 5
2 8
4 6
1 2
4 7
3 5

54
8
8
8
8
5
54
30
46
12
 63
10
92
34
24
53
9
5
11
54
 6400
4900
3600
2500
1600
900
400
100
100
2500
 103
148
457
524
659
45
148
215
350
103
170
215
67
112
45
 1000000
 25
55
35
9
21
 21
54
10
34
16
14
1
5
55
12
 42
5
8
5
1
6
76
6
28
10
 108
3
281
1
27
1
209
27
 1
1
 7
18
20
15
5
25
7
12
10
8

import java.util.*;
import java.io.*;
import java.math.BigInteger;
 
public class Main
{
	static final int mod = (int)1e9+7;
	static int N = (int)1e6 + 1;
	static long cur;
	static long[] freq = new long[N];
	public static void main(String[] args) throws Exception
	{
		FastReader in = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int q = in.nextInt();
		int[] arr = new int[n + 1];
		for(int i = 0; i < n; i++)
			arr[i] = in.nextInt();
		int[][] queries = new int[q][3];
		for(int i = 0; i < q; i++)
		{
			queries[i][0] = in.nextInt() - 1;
			queries[i][1] = in.nextInt() - 1;
			queries[i][2] = i;
		}
		int block = (int)Math.sqrt(n);
		Arrays.sort(queries, (int[] a, int[] b) ->
		{
			int ab = a[0] / block;
			int bb = b[0] / block;
			if(ab < bb)
				return -1;
			if(ab > bb)
				return 1;
			return Integer.compare(a[1], b[1]);
		});
		long[] ans = new long[q];
		cur = 0;
		int l = 0, r = -1;
		for(int i = 0; i < q; i++)
		{
			while(l < queries[i][0])
			{
				remove(arr[l]);
				l++;
			}

			while(l > queries[i][0])
			{
				l--;
				add(arr[l]);
			}

			while(r < queries[i][1])
			{
				r++;
				add(arr[r]);
			}

			while(r > queries[i][1])
			{
				remove(arr[r]);
				r--;
			}
			ans[queries[i][2]] = cur;
		}
		for(int i = 0; i < q; i++)
			out.println(ans[i]);
		out.flush();
	}

	static void add(int a)
	{
		cur += (freq[a] + freq[a] + 1) * a;
		freq[a]++;
	}

	static void remove(int a)
	{
		cur += (-freq[a] - freq[a] + 1) * a;
		freq[a]--;
	}
}
 
class FastReader
{
	BufferedReader br;
	StringTokenizer st;
 
	public FastReader()
	{
	    br = new BufferedReader(new InputStreamReader(System.in));
	}
 
	public String next() throws IOException
	{
	    if(st == null || !st.hasMoreElements())
	    {
	        st = new StringTokenizer(br.readLine());
	    }

	    return st.nextToken();
	}
 
	public int nextInt() throws IOException
	{
	    return Integer.parseInt(next());
	}
 
	public long nextLong() throws IOException
	{
	    return Long.parseLong(next());
	}
 
	public String nextLine() throws IOException
	{
		return br.readLine();
	}
}