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

public class PowerfulArray {

	static int BLOCK_SIZE;
	
	public static void main(String[] args) {
		JS scan = new JS();
		PrintWriter out = new PrintWriter(System.out);
		int n = scan.nextInt();
		int t = scan.nextInt();
		long[] arr = new long[n];
		for(int i = 0; i < n; i++) {
			arr[i] = scan.nextLong();
		}
		BLOCK_SIZE = (int)Math.sqrt(n);
		int[] f = new int[1_000_001];
		Query[] qarr = new Query[t];
		for(int i = 0; i < t; i++) {
			qarr[i] = new Query(scan.nextInt()-1, scan.nextInt()-1, i);
		}
		Arrays.sort(qarr);
		long[] ans = new long[t];
		int mo_left = 0;
		int mo_right = -1;
		long curr = 0;
		for(int i = 0; i < t; i++) {
			Query q = qarr[i];
			while(mo_right < q.r) {
				mo_right++;
				int x = f[(int)arr[mo_right]];
				curr -= arr[mo_right]*x*x;
				x++;
				curr += arr[mo_right]*x*x;
				f[(int)arr[mo_right]] = x;
			}
			while(mo_right > q.r) {
				int x = f[(int)arr[mo_right]];
				curr -= arr[mo_right]*x*x;
				x--;
				curr += arr[mo_right]*x*x;
				f[(int)arr[mo_right]] = x;
				mo_right--;
			}
			while(mo_left > q.l) {
				mo_left--;
				int x = f[(int)arr[mo_left]];
				curr -= arr[mo_left]*x*x;
				x++;
				curr += arr[mo_left]*x*x;
				f[(int) arr[mo_left]] = x;
			}
			while(mo_left < q.l) {
				int x = f[(int)arr[mo_left]];
				curr -= arr[mo_left]*x*x;
				x--;
				curr += arr[mo_left]*x*x;
				f[(int) arr[mo_left]] = x;
				mo_left++;
			}
			ans[q.i] = curr;
		}
		for(int i = 0; i < t; i++) {
			out.println(ans[i]);
		}
		out.flush();
	}
	
	static class Query implements Comparable<Query>{
		
		int l;
		int r;
		int i;
		
		public Query(int l, int r, int i) {
			this.l = l;
			this.r = r;
			this.i = i;
		}

		@Override
		public int compareTo(Query o) {
			if(l/BLOCK_SIZE==o.l/BLOCK_SIZE) return this.r-o.r;
			return l/BLOCK_SIZE-o.l/BLOCK_SIZE;
		}
	}
	
	static class JS{
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;
 
		public JS() {
			in = new BufferedInputStream(System.in, BS);
		}
 
		public JS(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}
 
		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}				
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}
 
		public int nextInt() {
			return (int)nextLong();
		}
 
		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}
 
		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}
 
		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
 
		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}
 
		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
	}
}
