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.DataInputStream;
                import java.io.FileInputStream;
                import java.io.IOException;
                import java.util.ArrayList;
                import java.util.Arrays;
                import java.util.PriorityQueue;
                import java.util.*;
                 
                public class snippet {
                 
                	static int mod = (int) 1e9 + 7;
                	static ArrayList<Integer> gr[];
                	static long ar[];
                	static Scanner sc = new Scanner(System.in);
                	static int pri[] = new int[(int) 1e6 + 5];
                	static StringBuilder out = new StringBuilder();
                 
                	public static class pair implements Comparable<pair> {
                		int id;
                		int ans;
                 
                		pair(int x, int y) {
                 
                			id = x;
                			ans = y;
                 
                		}
                 
                		public pair() {
                 
                		}
                 
                		public int compareTo(pair o) {
                			// TODO Auto-generated method stub
                 
                			return this.id - o.id;
                		}
                	}
                 
                	static void forl(int[] a, int s, int e) {
                		for (int i = s; i < e; i++) {
                			a[i] = sc.nextInt();
                		}
                	}
                 
                	static class query implements Comparable<query> {
                		int id, l, r;
                 
                		query(int id, int l, int r) {
                			this.id = id;
                			this.l = l;
                			this.r = r;
                		}
                 
                		@Override
                		public int compareTo(query o) {
                			// TODO Auto-generated method stub
                			 if ((this.l / block) != (o.l / block))
                                return this.l - o.l;
                            return ((this.l / block) % 2 != 0) ? (this.r - o.r) : (o.r - this.r);
                		}
                 
                	}
                 
                	static int block;
                	static long ans = 0;
                	static long[] cnt = new long[(int) 1e6 + 1];
                 
                	static void add(int l) {
                 
                		if(cnt[(int) ar[l]]!=0) {
                			ans-=cnt[(int) ar[l]]*cnt[(int) ar[l]]*ar[l];
                		}
                		cnt[(int) ar[l]]++;
                		ans += cnt[(int) ar[l]]*cnt[(int) ar[l]]*ar[l];
                 
                		
                	}
                 
                	static void remove(int l) {
                		ans-=cnt[(int) ar[l]]*cnt[(int) ar[l]]*ar[l];
                		cnt[(int) ar[l]]--;
                		if(cnt[(int) ar[l]]!=0) {
                			ans+=cnt[(int) ar[l]]*cnt[(int) ar[l]]*ar[l];
                		}
                		
                	}
                 
                	public static void main(String[] args) throws IOException {
                 
                		int t = 1;// sc.nextInt();
                		while (t-- > 0) {
                 
                			int n = sc.nextInt();
                			int q = sc.nextInt();
                 
                			ar = new long[n];
                			for (int i = 0; i < n; i++) {
                				ar[i] = sc.nextInt();
                			}
                			
                			block=(int) Math.sqrt(n);
                			query qu[]=new query[q];
                			for (int i = 0; i < q; i++) {
                				int l = sc.nextInt();
                				int r = sc.nextInt();
                				l--;
                				r--;
                				qu[i] = new query(i, l, r);
                 
                			}
                			Arrays.sort(qu);
                			long res[] = new long[q];
                			int cl = 0, cr = -1;
                			int cur_l = 0;
                		    int cur_r = -1;
                		   
                		    for (query q1 : qu) {
                		        while (cur_l > q1.l) {
                		            cur_l--;
                		            add(cur_l);
                		        }
                		        while (cur_r < q1.r) {
                		            cur_r++;
                		            add(cur_r);
                		        }
                		        while (cur_l < q1.l) {
                		            remove(cur_l);
                		            cur_l++;
                		        }
                		        while (cur_r > q1.r) {
                		            remove(cur_r);
                		            cur_r--;
                		        }
                		        res[q1.id] = ans;
                		    }
                 
                			for(int i=0;i<q;i++) {
                			
                				out.append(res[i]+"\n");
                			}
                		}
                		System.out.println(out);
                 
                	}
                 
                	static long solve(long x, long y, long z) {
                		return (long) ((x - y) * (x - y) + (y - z) * (y - z) + (z - x) * (z - x));
                	}class Reader {
                		final private int BUFFER_SIZE = 1 << 16;
                		private DataInputStream din;
                		private byte[] buffer;
                		private int bufferPointer, bytesRead;
                 
                		public Reader() {
                			din = new DataInputStream(System.in);
                			buffer = new byte[BUFFER_SIZE];
                			bufferPointer = bytesRead = 0;
                		}
                 
                		public Reader(String file_name) throws IOException {
                			din = new DataInputStream(new FileInputStream(file_name));
                			buffer = new byte[BUFFER_SIZE];
                			bufferPointer = bytesRead = 0;
                		}
                 
                		public String readLine() throws IOException {
                			byte[] buf = new byte[64]; // line length
                			int cnt = 0, c;
                			while ((c = read()) != -1) {
                				if (c == '\n')
                					break;
                				buf[cnt++] = (byte) c;
                			}
                			return new String(buf, 0, cnt);
                		}
                 
                		public int nextInt() throws IOException {
                			int ret = 0;
                			byte c = read();
                			while (c <= ' ')
                				c = read();
                			boolean neg = (c == '-');
                			if (neg)
                				c = read();
                			do {
                				ret = ret * 10 + c - '0';
                			} while ((c = read()) >= '0' && c <= '9');
                 
                			if (neg)
                				return -ret;
                			return ret;
                		}
                 
                		public long nextLong() throws IOException {
                			long ret = 0;
                			byte c = read();
                			while (c <= ' ')
                				c = read();
                			boolean neg = (c == '-');
                			if (neg)
                				c = read();
                			do {
                				ret = ret * 10 + c - '0';
                			} while ((c = read()) >= '0' && c <= '9');
                			if (neg)
                				return -ret;
                			return ret;
                		}
                 
                		public double nextDouble() throws IOException {
                			double ret = 0, div = 1;
                			byte c = read();
                			while (c <= ' ')
                				c = read();
                			boolean neg = (c == '-');
                			if (neg)
                				c = read();
                 
                			do {
                				ret = ret * 10 + c - '0';
                			} while ((c = read()) >= '0' && c <= '9');
                 
                			if (c == '.') {
                				while ((c = read()) >= '0' && c <= '9') {
                					ret += (c - '0') / (div *= 10);
                				}
                			}
                 
                			if (neg)
                				return -ret;
                			return ret;
                		}
                 
                		private void fillBuffer() throws IOException {
                			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
                			if (bytesRead == -1)
                				buffer[0] = -1;
                		}
                 
                		private byte read() throws IOException {
                			if (bufferPointer == bytesRead)
                				fillBuffer();
                			return buffer[bufferPointer++];
                		}
                 
                		public void close() throws IOException {
                			if (din == null)
                				return;
                			din.close();
                		}
                	}
                 
                }