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.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;

// this is not good for reading double values.
public class PowerfulArray {
	static long len;
	static long sum = 0;
	static long[] cnt, arr;

	public static void main(String[] args) throws IOException {
		Reader reader = new Reader();
		PrintWriter out = new PrintWriter(System.out, false);
		int N = reader.nextInt();
		arr = new long[N];
		int Q = reader.nextInt();
		long max = Integer.MIN_VALUE;
		for (int i = 0; i < N; i++) {
			arr[i] = reader.nextInt();
			if (max < arr[i]) {
				max = arr[i];
			}
		}
		cnt = new long[(int) (max + 1)];
		NoDe[] node = new NoDe[Q];
		len = (int) Math.ceil(Math.sqrt(arr.length));
		for (int i = 0; i < Q; i++)
			node[i] = new NoDe(reader.nextInt() - 1, reader.nextInt() - 1, i);
		Arrays.sort(node);
		int currentL = 0, currentR = 0;
		long[] ans = new long[Q];
		add(arr[0]);
		for (int i = 0; i < Q; i++) {
			int L = node[i].L;
			int R = node[i].R;
			while (currentR < R) {
				currentR++;
				add(arr[currentR]);
//				 System.out.println("currentR"+" "+currentR);
			}
			while (currentL > L) {
				currentL--;
				add(arr[currentL]);
//				 System.out.println("currentL"+" "+currentL);
			}
			while (currentR > R) {
				remove(arr[currentR]);
				currentR--;
//				 System.out.println("currentR"+" "+currentR);
			}
			while (currentL < L) {
				remove(arr[currentL]);
				currentL++;
//				 System.out.println("currentL"+" "+currentL);
			}
//			 System.out.println(Arrays.toString(cnt));
//			 System.out.println(currentL+" "+currentR);
			ans[node[i].i] = sum;
		}
		for (int i = 0; i < Q; i++) {
			out.println(ans[i]);
		}
		out.close();
	}

	private static void add(long i) {
		cnt[(int) i]++;
		sum += (((cnt[(int) i] << 1) - 1) * i);
	}

	private static void remove(long i) {
		cnt[(int) i]--;
		sum -= (i * ((cnt[(int) i] << 1) + 1));
	}

	static class NoDe implements Comparable<NoDe> {
		int L, R, i;

		NoDe(int L, int R, int i) {
			this.L = L;
			this.R = R;
			this.i = i;
		}

		public int compareTo(NoDe o) {

			if (L / len != o.L / len) {
				return (int) (L / len - o.L / len);
			}
			return R - o.R;
		}
	}

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public final String readString() throws IOException {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.append((char) c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (c == '.')
				while ((c = read()) >= '0' && c <= '9')
					ret += (c - '0') / (div *= 10);
			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}
}