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.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;

public class Main {
	public static class FastReader {
			BufferedReader br;
			StringTokenizer root;
			
	 
			public FastReader() {
				br = new BufferedReader(new InputStreamReader(System.in));
			}
	 
			String next() {
				while (root == null || !root.hasMoreTokens()) {
					try {
						root = new StringTokenizer(br.readLine());
					} catch (Exception addd) {
						addd.printStackTrace();
					}
				}
				return root.nextToken();
			}
	 
			int nextInt() {
				return Integer.parseInt(next());
			}
	 
			double nextDouble() {
				return Double.parseDouble(next());
			}
	 
			long nextLong() {
				return Long.parseLong(next());
			}
	 
			String nextLine() {
				String str = "";
				try {
					str = br.readLine();
				} catch (Exception addd) {
					addd.printStackTrace();
				}
				return str;
			}
		}
	 
	public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
	public static FastReader sc = new FastReader();
 
	static long mod = (long) (1e9+7),MAX=(long)(1e6+10);
	static List<Integer>[] edges;

	public static void main(String[] args) throws IOException{
		
		int n = sc.nextInt();
		size = (int) (Math.sqrt(n)+1);
		size = Math.min(size, n);
		int t = sc.nextInt();
		int[] a = new int[n];
		for(int i=0;i<n;++i) a[i] = sc.nextInt();
		
		Query[] q = new Query[t];
		for(int i=0;i<t;++i) {
			int l = sc.nextInt()-1;
			int r = sc.nextInt()-1;
			q[i] = new Query(l,r,i);
		}
		long[] ans = mo(a,q);
		for(long x : ans) out.println(x);
		
		out.close();

	}
	

	static int size;
	static long res;
	
	static long[] mo(int[] a, Query[] query) {
	   int n = query.length;
	   Arrays.sort(query);
	   
	   long[] ans = new long[n];
	   int st=0,end=-1; 
	   int[] map = new int[(int) (1e6+10)]; // if MAX ai = 1e6
	   res = 0;
	   for(Query q : query) {
		   while (st > q.l) {
	            st--;
	            add(map,a[st]);
	        }
	        while (end < q.r) {
	            end++;
	            add(map,a[end]);
	        }
	        while (st < q.l) {
	            delete(map,a[st]);
	            st++;
	        }
	        while (end > q.r) {
	        	delete(map,a[end]);
	            end--;
	        }
	        ans[q.idx] = res;
	   }
	   return ans;
	}
	
	private static void add(int[] map, int i) {
		long prev = map[i];
		map[i]++;
		long now = map[i];
		res-=prev*prev*i;
		res+=now*now*i;
		
	}

	private static void delete(int[] map, int i) {
		long prev = map[i];
		map[i]--;
		long now = map[i];
		res-=prev*prev*i;
		res+=now*now*i;
		
	}

	static class Query implements Comparable<Query>{
		int l,r,idx;
		Query(int l,int r,int idx){
			this.l = l;
			this.r = r;
			this.idx = idx;
		}

		@Override
		public int compareTo(Query q) {
			if(l/size != q.l/size) return l/size - q.l/size;
			return ((l/size)&1) == 1 ? r-q.r : q.r-r;
		}
		/*
		 *  In odd blocks sort the right index in ascending order and in even blocks
		 *  sort it in descending order. This will minimize the movement of right 
		 *  pointer, as the normal sorting will move the right pointer from the end 
		 *  back to the beginning at the start of every block. With the improved version
		 *  this resetting is no more necessary.
		 */
	}
	

}