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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedOutputStream;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

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

    static class TaskDD {
        public void solve(int testNumber, Kattio in, PrintWriter out) {
            int n = in.nextInt();
            int q = in.nextInt();
            int blockSize = (int) (Math.sqrt(n));

            int[] arr = new int[n + 1];
            for (int i = 1; i <= n; ++i)
                arr[i] = in.nextInt();
            Query[] queries = new Query[q];
            for (int i = 0; i < q; ++i) {
                queries[i] = new Query(in.nextInt(), in.nextInt(), i);
            }

            Arrays.sort(queries, (q1, q2) -> {
                if (q1.l / blockSize == q2.l / blockSize) {
                    return Integer.compare(q2.r, q1.r);
                }

                return Integer.compare(q1.l, q2.l);
            });

            long[] ans = new long[q];

            int curL = 1;
            int curR = 1;
            long sum = 0;

            long[] occs = new long[(int) 1e6 + 5];
            for (Query query : queries) {

                while (curL < query.l) {
                    int x = arr[curL++];
                    sum -= occs[x] * occs[x] * x;
                    sum += (occs[x] - 1) * (occs[x] - 1) * x;

                    --occs[x];
                }

                while (curL > query.l) {
                    int x = arr[--curL];
                    sum -= occs[x] * occs[x] * x;
                    sum += (occs[x] + 1) * (occs[x] + 1) * x;
                    ++occs[x];
                }

                while (curR <= query.r) {
                    int x = arr[curR++];

                    sum -= occs[x] * occs[x] * x;
                    sum += (occs[x] + 1) * (occs[x] + 1) * x;

                    ++occs[x];
                }

                while (curR > query.r + 1) {

                    int x = arr[--curR];

                    sum -= occs[x] * occs[x] * x;
                    sum += (occs[x] - 1) * (occs[x] - 1) * x;

                    --occs[x];
                }

                ans[query.index] = sum;
            }

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

        private class Query {
            int l;
            int r;
            int index;

            public Query(int l, int r, int index) {
                this.l = l;
                this.r = r;
                this.index = index;
            }

        }

    }

    static class Kattio extends PrintWriter {
        private BufferedReader r;
        private String line;
        private StringTokenizer st;
        private String token;

        public Kattio(InputStream i) {
            super(new BufferedOutputStream(System.out));
            r = new BufferedReader(new InputStreamReader(i));
        }

        public Kattio(InputStream i, OutputStream o) {
            super(new BufferedOutputStream(o));
            r = new BufferedReader(new InputStreamReader(i));
        }

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

        private String peekToken() {
            if (token == null)
                try {
                    while (st == null || !st.hasMoreTokens()) {
                        line = r.readLine();
                        if (line == null) return null;
                        st = new StringTokenizer(line);
                    }
                    token = st.nextToken();
                } catch (IOException e) {
                }
            return token;
        }

        private String nextToken() {
            String ans = peekToken();
            token = null;
            return ans;
        }

    }
}

