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.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;

public class D {
	static InputStreamReader isr = new InputStreamReader(System.in);
	static BufferedReader br = new BufferedReader(isr);

	static int[] readIntArray() throws IOException {
		String[] v = br.readLine().split(" ");
		int[] ans = new int[v.length];

		for (int i = 0; i < ans.length; i++) {
			ans[i] = Integer.valueOf(v[i]);
		}

		return ans;
	}

	static int N, Q;
	static int[] a;	

	public static void main(String[] args) throws IOException {
		int[] nq = readIntArray();
		N = nq[0];
		Q = nq[1];
		a = readIntArray();		

		StringBuilder sb = new StringBuilder();
		int cl = 0;
		int cr = 0;
		long val = a[0];
		int[] hist = new int[1 << 20];
		hist[a[0]] = 1;
		List<A> intervals = new ArrayList<D.A>();

		for (int i = 0; i < Q; i++) {
			int[] q = readIntArray();			
			intervals.add(new A(q[0] - 1, q[1] - 1, i));
		}
		sort(intervals);

		long[] ans = new long[Q];
		for (int i = 0; i < Q; i++) {
			A cur = intervals.get(i);

			while (cl < cur.l) {
				if (cl <= cr) {
					val = dec(val, hist, a[cl]);
					cl++;
				} else {
					cl = cur.l;
				}				
			}

			while (cl > cur.l) {
				cl--;
				if (cl <= cr) {
					val = inc(val, hist, a[cl]);					
				}
			}

			while (cr < cur.r) {
				cr++;
				if (cl <= cr) {
					val = inc(val, hist, a[cr]);					
				} else {
					cr = cl - 1;
				}
			}

			while (cr > cur.r) {
				if (cl <= cr) {
					val = dec(val, hist, a[cr]);					
				}
				cr--;
			}

			ans[cur.id] = val;
		}

		for (int i = 0; i < ans.length; i++) {
			if (sb.length() > 0) {
				sb.append('\n');
			}
			sb.append(ans[i]);
		}

		System.out.println(sb);
	}

	private static void sort(List<A> intervals) {
		Collections.sort(intervals);
	}

	private static long inc(long val, int[] hist, int i) {
		long t = hist[i] + (++hist[i]);			
		val += t * i;
		return val;
	}

	private static long dec(long val, int[] hist, int i) {
		long t = hist[i];
		val -= t * t * i;
		t--;
		val += t * t * i;
		hist[i] = Math.max(hist[i] - 1, 0);
		return val;
	}

	static class A implements Comparable<A> {

		private int l, r, id, size;

		@Override
		public String toString() {
			return l + " - " + r;
		}

		public A(int l, int r, int id) {
			this.l = l;
			this.r = r;
			this.id = id;
			this.size = this.r - this.l;
		}

		@Override
		public int compareTo(A b) {
			int k1 = this.l / 1000;
			int k2 = b.l / 1000;
			if (k1 == k2) {
				return new Integer(this.r).compareTo(b.r);
//				return new Double(Math.random()).compareTo(Math.random());
			}
			return new Integer(k1).compareTo(k2);
		}
	}
}
