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.*;
import java.text.*;
import java.util.*;
import java.math.*;
public class template {
	public static void main(String[] args) throws Exception {
		new template().run();
	}
	public void run() throws Exception {
		FastScanner f = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = f.nextInt(), m = f.nextInt();
		int[] arr = new int[n];
		for(int i = 0; i < n; i++) arr[i] = f.nextInt();
		Query[] q = new Query[m];
		for(int i = 0; i < m; i++) q[i] = new Query(f.nextInt()-1, f.nextInt(), i);
		bucket = (int) Math.sqrt(n);
		Arrays.sort(q);
		int l = 0, r = 0;
		long[] ans = new long[m];
		long[] hm = new long[1000001];
		long[] hmI = new long[1000001];
		long[] temp = new long[1000001];
		long curans = 0;
		int curhmI = 0;
		for(Query qq : q) {
			if(l/bucket < qq.l/bucket) {
				l += bucket;
				r = l;
				curans = 0;
				curhmI++;
			}
			while(r < qq.r) {
				long v = hmI[arr[r]] == curhmI ? hm[arr[r]] : 0;
				hm[arr[r]] = v+1;
				hmI[arr[r]] = curhmI;
				curans += ((v+1)*(v+1)-v*v)*arr[r];
				r++;
			}
			ans[qq.i] = curans;
			for(int ll = l; ll < qq.l; ll++)
				temp[arr[ll]]++;
			
			for(int ll = l; ll < qq.l; ll++) {
				long a = hm[arr[ll]];
				long b = temp[arr[ll]];
				if(b == 0) continue;
				ans[qq.i] += arr[ll]*((a-b)*(a-b) - a*a);
				temp[arr[ll]] = 0;
			}
		}
		for(long ll : ans) out.println(ll);
		out.flush();
	}
	int bucket;
	class Query implements Comparable<Query> {
		int l, r, i;
		public Query(int a, int b, int i) {
			this.l = a;
			this.r = b;
			this.i = i;
		}
		public int compareTo(Query q) {
			int res = Integer.compare(l/bucket, q.l/bucket);
			if(res == 0) res = Integer.compare(r, q.r);
			return res;
		}
	}
///
	static class FastScanner {
		public BufferedReader reader;
		public StringTokenizer tokenizer;
		public FastScanner() {
			reader = new BufferedReader(new InputStreamReader(System.in), 32768);
			tokenizer = null;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		public String nextLine() {
			try {
				return reader.readLine();
			} catch(IOException e) {
				throw new RuntimeException(e);
			}
		}
	}
}
