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.util.*;

public class powerfularray {

	public static void main(String[] args) throws Exception{
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		
		StringTokenizer st = new StringTokenizer(f.readLine());
		
		int N = Integer.parseInt(st.nextToken());
		int M = Integer.parseInt(st.nextToken());
		int k = (int)(Math.ceil(Math.sqrt(N))*2);
		int[] a = new int[N];
		
		st = new StringTokenizer(f.readLine());
		for(int i = 0;i<N;i++) {
			a[i] = Integer.parseInt(st.nextToken());
		}
		
		ArrayList<Pair>[] q = new ArrayList[k];
		
		for(int i = 0;i<k;i++) {
			q[i] = new ArrayList<Pair>();
		}
		for(int i = 0;i<M;i++) {
			st = new StringTokenizer(f.readLine());
			
			int l = Integer.parseInt(st.nextToken()) - 1;
			int r = Integer.parseInt(st.nextToken()) - 1;
			
			Pair p = new Pair(l,r,i);
			
			q[l/k].add(p);
		}
		
		for(int i = 0;i<k;i++) {
			if(i%2 == 0) {
				Collections.sort(q[i], new Comparator<Pair>() {

				@Override
					public int compare(Pair p1, Pair p2) {
						return p1.r - p2.r;
					}
				
				});
			}
			else {
				Collections.sort(q[i], new Comparator<Pair>() {

					@Override
						public int compare(Pair p1, Pair p2) {
							return p2.r - p1.r;
						}
					
					});
			}
		}
		/*
		for(int i = 0;i<k;i++) {
			for(int j = 0;j<q[i].size();j++) {
				q[i].get(j).print();
			}
		}
		*/
		long[] ret = new long[M];
		
		int cL = 0;
		int cR = 0;
		int[] count = new int[(int)(1e6 + 5)];
		count[a[0]] ++;
		long ans = a[cL]*(count[a[cL]]*count[a[cL]] - (count[a[cL]]-1)*(count[a[cL]]-1));
		for(int i = 0;i<k;i++) {
			
			for(int j = 0;j<q[i].size();j++) {
				
				while(cL < q[i].get(j).l) {					
					count[a[cL]] --;
					int n = count[a[cL]];
					ans -= a[cL]*(2*n + 1);
					cL ++;
				}
				
				while(cL > q[i].get(j).l) {
					cL--;
					count[a[cL]] ++;
					int n = count[a[cL]] - 1;
					ans += a[cL]*(2*n + 1);
				}
				while(cR < q[i].get(j).r) {
					cR ++;
					count[a[cR]] ++;
					int n = count[a[cR]] - 1;
					ans += a[cR]*(2*n + 1);
				}
				while(cR > q[i].get(j).r) {
					count[a[cR]] --;
					int n = count[a[cR]];
					ans -= a[cR]*(2*n+1);
					cR --;
				}
				
				ret[q[i].get(j).i] = ans;
			}
		}
		
		for(int i = 0;i<M;i++) {
			System.out.println(ret[i]);
		}

	}
	
	public static class Pair {
		int l;
		int r;
		int i;
		Pair(int l, int r, int i) {
			this.l = l;
			this.r = r;
			this.i = i;
		}
		void print() {
			System.out.println(l + " " + r);
		}
	}

}
