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

//package yandex2011.r2;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class D {
	Scanner in;
	PrintWriter out;
//	String INPUT = "3 2 1 2 1 1 2 1 3";
//	String INPUT = "8 3 1 1 2 2 1 3 1 1 2 7 1 6 2 7";
//	String INPUT = "20 8\r\n" +
//			"\r\n" +
//			"1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2\r\n" +
//			"\r\n" +
//			"4 15\r\n" +
//			"\r\n" +
//			"1 2\r\n" +
//			"\r\n" +
//			"2 20\r\n" +
//			"\r\n" +
//			"7 7\r\n" +
//			"\r\n" +
//			"13 18\r\n" +
//			"\r\n" +
//			"7 7\r\n" +
//			"\r\n" +
//			"3 19\r\n" +
//			"\r\n" +
//			"3 8";
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int t = ni();
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		int[][] q = new int[t][3]; // end start ind
		for(int i = 0;i < t;i++){
			q[i][0] = ni() - 1;
			q[i][1] = ni() - 1;
			q[i][2] = i;
		}
		final int sq = (int)Math.sqrt(n);
		Arrays.sort(q, new Comparator<int[]>(){
			public int compare(int[] a, int[] b){
				if(a[0] / sq == b[0] / sq){
					return b[1] - a[1];
				}else{
					return a[0] - b[0];
				}
			}
		});
		
		long[] ret = new long[t];
		int start = 0;
		int end = 0;
		int[] ct = new int[1000001];
		long sum = 0;
		for(int i = 0;i < t;i++){
			if(start < q[i][0]){
				for(;start < q[i][0];start++)sum -= (long)a[start] * (2*(ct[a[start]]--)-1);
			}else{
				for(;start > q[i][0];start--)sum += (long)a[start-1] * (2*(ct[a[start-1]]++)+1);
			}
			if(end < q[i][1]+1){
				for(;end < q[i][1]+1;end++)sum += (long)a[end] * (2*(ct[a[end]]++)+1);
			}else if(end > q[i][1]+1){
				for(;end > q[i][1]+1;end--)sum -= (long)a[end-1] * (2*(ct[a[end-1]]--)-1);
			}
			ret[q[i][2]] = sum;
		}
		for(long x : ret){
			out.println(x);
		}
	}
	
	void run() throws Exception
	{
		in = INPUT.isEmpty() ? new Scanner(System.in) : new Scanner(INPUT);
		out = new PrintWriter(System.out);

		solve();
		out.flush();
	}
	
	
	public static void main(String[] args) throws Exception
	{
		new D().run();
	}
	
	int ni() { return Integer.parseInt(in.next()); }
	double nd() { return Double.parseDouble(in.next()); }
	void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
