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.util.*;
import java.io.*;
import java.math.BigInteger;
import static java.lang.Math.*;

public class rb_sol implements Runnable {
	StringTokenizer tokenizer = new StringTokenizer("");
	BufferedReader in;
	PrintWriter out;

	public static void main(String[] args) {
		new Thread(new rb_sol()).start();
	}

	int [] a, vi, count;
	int n, t, parts;
	Seg [] arr;

	class Seg implements Comparable <Seg> {
		int l, r, part, index;

		Seg(int l, int r, int index) {
			this.l = l;
			this.r = r;            
			this.index = index;
			part = (l * parts) / n;
		}

		public int compareTo(Seg s) {
			if (part != s.part) return part - s.part;
			return r - s.r;			
		}	
	}

	long cres = 0;

	void add(int i) {
		cres += (long)a[i] * (2 * (count[vi[i]]++) + 1);
	}

	void sub(int i) {
		cres -= (long)a[i] * (2 * (count[vi[i]]--) - 1);
	}

	public void run() {
		try {
			Locale.setDefault(Locale.US);
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			
			n = nextInt();
			t = nextInt();
			parts = max(1, min(n, (int)sqrt(t + 2)));
			
			a = new int[n];
			for (int i = 0; i < n; i++) a[i] = nextInt();
			
			arr = new Seg[t];
			for (int i = 0; i < t; i++) {
				arr[i] = new Seg(nextInt() - 1, nextInt() - 1, i);	
			}
			
			Arrays.sort(arr);
			
			vi = new int[n];
			HashMap <Integer, Integer> mi = new HashMap <Integer, Integer> ();
			int cnt = 0;
			for (int i = 0; i < n; i++) {
				if (!mi.containsKey(a[i])) mi.put(a[i], cnt++);
				vi[i] = mi.get(a[i]);
			}
			
			count = new int[cnt]; // different values

			int cl = 0, cr = -1;
			long [] res = new long[t];
			for (int i = 0; i < t; i++) {
				int l = arr[i].l, r = arr[i].r;
				while (cl < l) sub(cl++);
				while (cl > l) add(--cl); 
				while (cr < r) add(++cr);
				while (cr > r) sub(cr--);
				res[arr[i].index] = cres;
			}
			
			for (int i = 0; i < t; i++) out.println(res[i]);

			out.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

	boolean seekForToken() {
		while (!tokenizer.hasMoreTokens()) {
			String s = null;
			try {
				s = in.readLine();
			} catch (Exception e) {
				e.printStackTrace();
			}
			if (s == null)
				return false;
			tokenizer = new StringTokenizer(s);
		}
		return true;
	}

	String nextToken() {
		return seekForToken() ? tokenizer.nextToken() : null;
	}

	int nextInt() {
		return Integer.parseInt(nextToken());
	}
}
