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

public class Main {

	BufferedReader in;
	StringTokenizer str = null;
	PrintWriter out;
	
	private String next() throws Exception{
		while (str == null || !str.hasMoreElements())
			str = new StringTokenizer(in.readLine());
		return str.nextToken();
	}
	
	private int nextInt() throws Exception{
		return Integer.parseInt(next());
	}
	
	private long nextLong() throws Exception{
		return Long.parseLong(next());
	}
	
	private double nextDouble() throws Exception{
		return Double.parseDouble(next());
	}

	final long oo = Long.MAX_VALUE;
	long answer = 0;
    int []freq;

	public void run() throws Exception{
		in =  new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		int n = nextInt(), m = nextInt();
        int []a = new int[n];
        for(int i = 0; i < n; ++i) a[i] = nextInt();
        
        Query []q = new Query[m];
        Query.BLOCK = (int)Math.sqrt(n);
        for(int i = 0; i < m; ++i) {
            q[i] = new Query(nextInt() - 1, nextInt() - 1, i);
        }
        Arrays.sort(q);

        // for(Query i : q) System.out.println(i);
        // System.out.println();

        long []ans = new long[m];
        int curl = 0, curr = -1;
        freq = new int[1000001];

        for(int i = 0; i < m; ++i) {
            int l = q[i].l, r = q[i].r;
            // System.out.println(q[i] + " " + curl + " " + curr);
            while(curl < l) {
                dec(a[curl++]);
            }

            while(curl > l) {
                inc(a[--curl]);
            }

            while(curr > r) {
                dec(a[curr--]);
            }

            while(curr < r) {
                inc(a[++curr]);
            }
            // System.out.println("query = " + q[i] + " -> " + answer);
            ans[q[i].pos] = answer;
        }

        for(long i : ans)
            out.println(i);
		out.close();
	}

    private void inc(int x) {
        answer += 1L * x * (2 * freq[x] + 1);
        ++freq[x];
    }

    private void dec(int x) {
        answer -= 1L * x * (2 * freq[x] - 1);
        --freq[x];
    }

    static class Query implements Comparable<Query> {
        static int BLOCK;

        int l, r, pos;
        int block;

        public Query(int l, int r, int pos) {
            this.l = l;
            this.r = r;
            this.pos = pos;
            this.block = l / BLOCK;
        }

        public int compareTo(Query other) {
            if (this.block != other.block) return this.block - other.block;
            return this.r - other.r;
        }

        public String toString() {
            return this.l + " " + this.r;
        }
    }

	public static void main(String[] args) throws Exception{
		new Main().run();
	}
}