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.Collections;
import java.util.StringTokenizer;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		InputReader r = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		int N = r.nextInt();
		int Q = r.nextInt();
		
		int[] a = new int[N];
		for(int i = 0; i < N; i++)
			a[i] = r.nextInt();
		
		int K = 800;
		
		ArrayList<I>[] SQ = new ArrayList[N / K + 1];
		for(int i = 0; i < N / K + 1; i++)
			SQ[i] = new ArrayList<I>();
		
		for(int k = 0; k < Q; k++){
			int L = r.nextInt() - 1;
			int R = r.nextInt() - 1;
			
			SQ[L / K].add(new I(L, R, k));
		}
		
		long[] V = new long[1000010];
		long[] RET = new long[Q];
		
		for(int x = 0; x < N / K + 1; x++){
			Collections.sort(SQ[x]);
			
			int L = -1;
			int R = -1;
			
			long sum = 0;
			for(I i : SQ[x]){
				if(R == -1){
					L = R = i.R;
					sum += a[R] + a[R] * V[a[R]] * 2;
					V[a[R]]++;
				}
				while(R < i.R){
					R++;
					sum += a[R] + a[R] * V[a[R]] * 2;
					V[a[R]]++;
				}
				while(i.L < L){
					L--;
					sum += a[L] + a[L] * V[a[L]] * 2;
					V[a[L]]++;
				}
				while(L < i.L){
					sum += a[L] - a[L] * V[a[L]] * 2;
					V[a[L]]--;
					L++;
				}
				RET[i.i] = sum;
			}
			
			if(R != -1)
			for(int y = L; y <= R; y++)
				V[a[y]] = 0;
		}
		
		for(int i = 0; i < Q; i++)
			out.println(RET[i]);
		out.close();
	}
	static class I implements Comparable<I>{
		int L, R, i;
		public I(int Li, int Ri, int ii){
			L = Li;
			R = Ri;
			i = ii;
		}
		@Override
		public int compareTo(I b) {
			if(R == b.R)return L - b.L;
			else return R - b.R;
		}
	}
	static class InputReader {
		private BufferedReader reader;
		private StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = null;
		}	

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
				return null;
			}
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public double nextDouble(){
			return Double.parseDouble(next());
		}
	}
}
