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

public class D86 implements Runnable {

	class Request {
		int l, r, ind;

		Request(int l, int r, int ind) {
			this.l = l;
			this.r = r;
			this.ind = ind;
		}
	}

	int[] cnt = new int[1000001];
	long cur;

	private void Solution() throws IOException {
		int n = nextInt(), t = nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = nextInt();
		Request[] req = new Request[t];
		for (int i = 0; i < t; i++)
			req[i] = new Request(nextInt() - 1, nextInt() - 1, i);
		final int sqrt = (int) Math.sqrt(n);
		Arrays.sort(req, new Comparator<Request>() {
			public int compare(Request a, Request b) {
				if (a.l / sqrt == b.l / sqrt)
					return b.r - a.r;
				else
					return a.l - b.l;
			}
		});
		int l = 0, r = 0;
		long[] ans = new long[t];
		for (int i = 0; i < t; i++) {
			if (l < req[i].l)
				for (; l < req[i].l; l++)
					change(a[l], -1);
			else
				for (; l > req[i].l; l--)
					change(a[l - 1], 1);
			if (r < req[i].r + 1)
				for (; r < req[i].r + 1; r++)
					change(a[r], 1);
			else if (r > req[i].r + 1)
				for (; r > req[i].r + 1; r--)
					change(a[r - 1], -1);
			ans[req[i].ind] = cur;
		}
		for (long res : ans)
			println(res);
	}

	void change(int a, int w) {
		cur += (long) w * a * (2 * cnt[a] + w);
		cnt[a] += w;
	}

	public static void main(String[] args) {
		new D86().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tokenizer;

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			Solution();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(0);
		}
	}

	void print(Object... obj) {
		for (int i = 0; i < obj.length; i++) {
			if (i != 0)
				out.print(" ");
			out.print(obj[i]);
		}
	}

	void println(Object... obj) {
		print(obj);
		print("\n");
	}

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

	long nextLong() throws NumberFormatException, IOException {
		return Long.parseLong(next());
	}

	double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(next());
	}

	String nextLine() throws IOException {
		return in.readLine();
	}

	String next() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(nextLine());
		return tokenizer.nextToken();
	}
}
