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.util.Arrays;
import java.util.StringTokenizer;
import java.util.stream.Collectors;

public class Main {
	static final int LIMIT = 1_000_000;

	public static void main(String[] args) throws Throwable {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer st = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(st.nextToken());
		int t = Integer.parseInt(st.nextToken());
		st = new StringTokenizer(br.readLine());
		int[] a = new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i] = Integer.parseInt(st.nextToken());
		}
		Query[] queries = new Query[t];
		for (int i = 0; i < queries.length; i++) {
			st = new StringTokenizer(br.readLine());

			int l = Integer.parseInt(st.nextToken()) - 1;
			int r = Integer.parseInt(st.nextToken()) - 1;

			queries[i] = new Query(i, l, r);
		}
		System.out.println(solve(a, queries));
	}

	static String solve(int[] a, Query[] queries) {
		int[] counts = new int[LIMIT + 1];
		long power = 0;
		int beginIndex = 0;
		int endIndex = -1;
		long[] result = new long[queries.length];

		int blockSize = (int) Math.round(Math.sqrt(queries.length));
		Arrays.sort(queries,
				(q1, q2) -> (q1.l / blockSize != q2.l / blockSize) ? Integer.compare(q1.l / blockSize, q2.l / blockSize)
						: Integer.compare(q1.r, q2.r));

		for (Query query : queries) {
			while (beginIndex < query.l) {
				counts[a[beginIndex]]--;
				power -= (2L * counts[a[beginIndex]] + 1) * a[beginIndex];
				beginIndex++;
			}
			while (beginIndex > query.l) {
				beginIndex--;
				power += (2L * counts[a[beginIndex]] + 1) * a[beginIndex];
				counts[a[beginIndex]]++;
			}

			while (endIndex < query.r) {
				endIndex++;
				power += (2L * counts[a[endIndex]] + 1) * a[endIndex];
				counts[a[endIndex]]++;
			}
			while (endIndex > query.r) {
				counts[a[endIndex]]--;
				power -= (2L * counts[a[endIndex]] + 1) * a[endIndex];
				endIndex--;
			}

			result[query.index] = power;
		}

		return Arrays.stream(result).mapToObj(String::valueOf).collect(Collectors.joining("\n"));
	}
}

class Query {
	int index;
	int l;
	int r;

	Query(int index, int l, int r) {
		this.index = index;
		this.l = l;
		this.r = r;
	}
}