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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.PriorityQueue;
import java.util.Queue;

public class D {
	
	static int block;
	
	static class Mo implements Comparable<Mo> {
		int id, l, r;
		
		public Mo(int id, int l, int r) {
			this.id = id;
			this.l = l;
			this.r = r;
		}

		@Override
		public int compareTo(Mo o) {
			if (this.l/block != o.l/block) {
				return this.l/block - o.l/block;
			}
			if ((this.l/block) % 2 == 0) {
				return this.r - o.r;
			} else {
				return o.r - this.r;
			}
		}
		
		
	}
	
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		String[] parts = br.readLine().split(" ");
		int n = Integer.parseInt(parts[0]);
		int t = Integer.parseInt(parts[1]);
		block = (int)Math.sqrt(n);
		int[] arr = new int[n];
		parts = br.readLine().split(" ");
		for (int i = 0; i < n; ++i) {
			arr[i] = Integer.parseInt(parts[i]);
		}
		Queue<Mo> pq = new PriorityQueue<>();
		int l, r;
		for (int i = 0; i < t; ++i ) {
			parts = br.readLine().split(" ");
			l = Integer.parseInt(parts[0]) - 1;
			r = Integer.parseInt(parts[1]) - 1;
			pq.add(new Mo(i, l, r));
		}
		Mo curr;
		long[] count = new long[1000005];
		long[] ans = new long[t];
		count[arr[0]]++;
		int currL = 0, currR = 0;
		long currAns = arr[0]*1*1;
		while (!pq.isEmpty()) {
			curr = pq.poll();
			while (curr.l < currL) {
				--currL;
				currAns -= count[arr[currL]]*count[arr[currL]]*((long)arr[currL]);
				++count[arr[currL]];
				currAns += count[arr[currL]]*count[arr[currL]]*((long)arr[currL]);
			}
			while (currR < curr.r) {
				++currR;
				currAns -= count[arr[currR]]*count[arr[currR]]*((long)arr[currR]);
				++count[arr[currR]];
				currAns += count[arr[currR]]*count[arr[currR]]*((long)arr[currR]);
			}
			while (currL < curr.l) {
				currAns -= count[arr[currL]]*count[arr[currL]]*((long)arr[currL]);
				--count[arr[currL]];
				currAns += count[arr[currL]]*count[arr[currL]]*((long)arr[currL]);
				++currL;
			}
			while (curr.r < currR) {
				currAns -= count[arr[currR]]*count[arr[currR]]*((long)arr[currR]);
				--count[arr[currR]];
				currAns += count[arr[currR]]*count[arr[currR]]*((long)arr[currR]);
				--currR;
			}
			ans[curr.id] = currAns;
		}
		for (int i = 0; i < ans.length; ++i) {
			out.println(ans[i]);
		}
		out.close();
	}

}
