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.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;

public class D {
	public static int b;
	public static void main(String[] args) throws IOException {
		FastScanner in= new FastScanner(System.in);
		PrintWriter out= new PrintWriter(System.out);
		
		int n= in.nextInt();
		int q= in.nextInt();
		
		int [] a= new int[n];
		for (int i = 0; i < a.length; i++) {
			a[i]= in.nextInt();
		}
		query [] qq= new query[q];
		for (int i = 0; i < qq.length; i++) {
			qq[i]= new query(in.nextInt()-1, in.nextInt()-1, i);
		}
		b= (int) (Math.sqrt(n)+1);
		Arrays.sort(qq);
		long [] ans= new long[q];
		long [] f= new long[1000007];
		int cl = 0, cr = 0;
		long res=a[0];
		f[a[0]]++;
		for (int i = 0; i < q; i++) {
			int l = qq[i].l;
			int r = qq[i].r;

			while (cl < l) {
				res -= (long) a[cl] * ((f[a[cl]] << 1) - 1);
				f[a[cl++]]--;
			}
			while (cl > l) {
				f[a[--cl]]++;
				res += (long) a[cl] * ((f[a[cl]] << 1) - 1);
			}
			while (cr < r) {
				f[a[++cr]]++;
				res+= (long) a[cr] * ((f[a[cr]] << 1) - 1);
			}
			while (cr > r) {
				res -= (long) a[cr] * ((f[a[cr]] << 1) - 1);
				f[a[cr--]]--;
			}
			ans[qq[i].id]= res;
		}

		for (int i = 0; i < ans.length; i++) {
			out.println(ans[i]);
		}
		
		out.close();
		
	}
	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
			st = new StringTokenizer("");
		}

		public String next() throws IOException {
			if (!st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine());
				return next();
			}
			return st.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
		public double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}
		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
	}
	static class query implements Comparable <query>{

		public int l, r, id;

		public query(int a, int b, int c) {
			l = a;
			r = b;
			id= c;
		}
		public int compareTo(query o) {
			int thing= l/b;
			int thing1= o.l/b;
			if (thing != thing1) {
				return thing-thing1;
			} 
			if((thing&1)==1) {
				return r-o.r;
			}
			return o.r-r;
		}
	}
}
/*
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

20 2
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2
2 20
3 19

*/