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.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws Exception {

		FastScanner scan = new FastScanner();
		int n = scan.nextInt();
		sqrt = (int) Math.sqrt(n);
		sqrt = (n + sqrt - 1) / sqrt;
		int t = scan.nextInt();
		long[] ans = new long[t];
		int[] a = new int[n];
		int[] count = new int[1000001];
		for (int i = 0; i < n; i++)
			a[i] = scan.nextInt();
		Query[] q = new Query[t];
		for (int i = 0; i < t; i++)
			q[i] = new Query(i, scan.nextInt() - 1, scan.nextInt() - 1);
		Arrays.sort(q);
		long val = 0;
		int l = q[0].l, r = q[0].r;
		for (int i = l; i <= r; i++) {
			val += a[i] * (long) (2 * count[a[i]] + 1);
			count[a[i]]++;
		}
		ans[q[0].index] = val;
		for (int i = 1; i < t; i++) {
			while (l > q[i].l) {
				l--;
				val += a[l] * (long) (2*count[a[l]] + 1);
				count[a[l]]++;
			}
			while (r < q[i].r) {
				r++;
				val += a[r] * (long) (2*count[a[r]] + 1);
				count[a[r]]++;
			}
			while (l < q[i].l) {
				val += a[l] * (long) (-2*count[a[l]] + 1);
				count[a[l]]--;
				l++;
			}
			while (r > q[i].r) {
				val += a[r] * (long) (-2*count[a[r]] + 1);
				count[a[r]]--;
				r--;
			}
			ans[q[i].index] = val;
		}
		StringBuilder sb = new StringBuilder();
		for (long i : ans){
			sb.append(i); sb.append('\n');
		}
		System.out.print(sb);
	}

	static int sqrt = 490;

	static class Query implements Comparable<Query> {
		int index, l, r;

		public Query(int i, int a, int b) {
			index = i;
			l = a;
			r = b;
		}

		@Override
		public int compareTo(Query other) {
			int a = this.l / sqrt, b = other.l / sqrt;
			if (a != b)
				return a - b;
			return this.r - other.r;
		}
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() throws Exception {
			br = new BufferedReader(new InputStreamReader(System.in));
			st = new StringTokenizer("");
		}

		public FastScanner(String filename) throws Exception {
			br = new BufferedReader(new FileReader(filename));
			st = new StringTokenizer("");
		}

		public String nextLine() throws Exception {
			return br.readLine();
		}

		public String next() throws Exception {
			while (!st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws Exception {
			return Integer.parseInt(next());
		}

		public long nextLong() throws Exception {
			return Long.parseLong(next());
		}

		public double nextDouble() throws Exception {
			return Double.parseDouble(next());
		}
	}
}