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 Main {
    static int n, q, size;
    static int[] arr, ri;
    static long[] out;
    static query[] qs;
	public static void main (String[] args) throws IOException {
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	    PrintWriter pw = new PrintWriter(System.out);
	    String[] line = br.readLine().split(" ");
	    n = p(line[0]);
	    q = p(line[1]);
	    size = (int)Math.sqrt(n);
	    arr = new int[n];
	    ri = new int[n];
	    out = new long[q];
	    qs = new query[q];
	    
	    line = br.readLine().split(" ");
	    int currB = 0;
	    for(int i = 0; i < n; ++i){
	        if(i % size == 0) ++currB;
	        ri[i] = currB * size - 1;
	        arr[i] = p(line[i]);
	    }
	    
	    for(int i = 0; i < q; ++i){
	        line = br.readLine().split(" ");
	        int a = p(line[0]) - 1, b = p(line[1]) - 1;
	        qs[i] = new query(a, b, i);
	    }
	    Arrays.sort(qs);
	    
	    int[] freq = new int[1_000_001];
	    freq[arr[0]] = 1;
	    int l = 0, r = 0;
	    long ans = arr[0];
	    for(int i = 0; i < q; ++i){
	        query curr = qs[i];
	        int cl = curr.l, cr = curr.r;
	        
	        while(l < cl){
	            long cf = freq[arr[l]];
	            ans -= cf * cf * arr[l];
	            --freq[arr[l]];
	            --cf;
	            ans += cf * cf * arr[l];
	            ++l;
	        }
	        while(l > cl){
	            --l;
	            long cf = freq[arr[l]];
	            ans -= cf * cf * arr[l];
	            ++freq[arr[l]];
	            ++cf;
	            ans += cf * cf * arr[l];
	        }
	        while(r < cr){
	            ++r;
	            long cf = freq[arr[r]];
	            ans -= cf * cf * arr[r];
	            ++freq[arr[r]];
	            ++cf;
	            ans += cf * cf * arr[r];
	        }
	        while(r > cr){
	            long cf = freq[arr[r]];
	            ans -= cf * cf * arr[r];
	            --freq[arr[r]];
	            --cf;
	            ans += cf * cf * arr[r];
	            --r;
	        }
	        
	        out[curr.i] = ans;
	    }
	    
	    for(long curr : out) pw.println(curr);
	    pw.close();
	}
	static class query implements Comparable<query> {
	    int l, r, i;
	    query(int ll, int rr, int ii){
	        l = ll;
	        r = rr;
	        i = ii;
	    }
	    public int compareTo(query in){
	        int d = ri[l] - ri[in.l];
	        if(d != 0) return d;
	        if((l / size) % 2 == 0) return r - in.r;
	        return in.r - r;
	    }
	}
	static int p(String in){
	    return Integer.parseInt(in);
	}
}