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.IOException;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author George Marcus
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskD {
    private static final int MAX = 1000001;
    int[] A;
    int M;
    int[][] queries;
    long S;
    int[] cnt;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int N = in.nextInt();
        int Q = in.nextInt();
        A = new int[N];
        for(int i = 0; i < N; i++)
            A[i] = in.nextInt();

        M = 0;
        while((M + 1) * (M + 1) <= N)
            M++;
        queries = new int[Q][3];
        for(int i = 0; i < Q; i++) {
            queries[i][0] = in.nextInt() - 1;
            queries[i][1] = in.nextInt() - 1;
            queries[i][2] = i;
        }
        Arrays.sort(queries, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                int g = o1[0] / M;
                int og = o2[0] / M;
                if(g != og)
                    return g - og;
                return o1[1] - o2[1];
            }
        });

        long[] ans = new long[Q];
        cnt = new int[MAX];

        S = 0;
        int left = 0;
        int right = -1;
        for(int i = 0; i < Q; i++) {
            go(left, queries[i][0], -1);
            left = queries[i][0];
            go(right, queries[i][1], 1);
            right = queries[i][1];
            ans[ queries[i][2] ] = S;
        }

        for(int i = 0; i < Q; i++)
            out.println(ans[i]);
    }

    private void go(int a, int b, int sign) {
        int dir = 1;
        if(a > b) {
            sign = -sign;
            dir = -dir;
        }

        if(sign == 1) {
            a += dir;
            b += dir;
        }

        for(int i = Math.max(0, a); i != b; i += dir) {
            int val = A[i];
            if(sign == 1) {
                ++cnt[val];
                S += sign * val * (2 * cnt[val] - 1);
            }
            else {
                S += sign * val * (2 * cnt[val] - 1);
                --cnt[val];
            }
        }
    }

}

class InputReader {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;

    public InputReader(InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

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

    public String nextString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuffer res = new StringBuffer();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));

        return res.toString();
    }

    private boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    }

