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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author AEoui
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyInputReader in = new MyInputReader(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, MyInputReader in, PrintWriter out) {
            int n = in.nextInt();
            int q = in.nextInt();

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

            TaskDD.Query.BLOCK_SIZE = (int) Math.sqrt(n);

            TaskDD.Query[] queries = new TaskDD.Query[q];
            for (int i = 0; i < q; ++i)
                queries[i] = new TaskDD.Query(in.nextInt() - 1, in.nextInt() - 1, i);

            Arrays.sort(queries);
            int l = 0, r = 0;
            long sum = 0;
            long[] occs = new long[(int) 1e6 + 1];
            long[] ans = new long[q];
            for (TaskDD.Query query : queries) {
                while (l < query.l) {
                    int x = arr[l++];
                    sum -= occs[x] * occs[x] * x;
                    sum += (occs[x] - 1) * (occs[x] - 1) * x;
                    --occs[x];
                }

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

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

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

                ans[query.id] = sum;
            }


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

        private static class Query implements Comparable<TaskDD.Query> {
            public int l;
            public int r;
            public int id;
            public int block;
            public static int BLOCK_SIZE;

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

                this.block = this.l / BLOCK_SIZE;
            }


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

                return this.block - q.block;
            }

        }

    }

    static class MyInputReader {
        private InputStream stream;
        private byte[] buffer = new byte[1024];
        private int currentCharacter;
        private int numberCharacters;

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

        public int nextToken() {
            if (numberCharacters == -1) throw new InputMismatchException();
            if (currentCharacter >= numberCharacters) {
                currentCharacter = 0;

                try {
                    numberCharacters = stream.read(buffer);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numberCharacters <= 0) return -1;
            }

            return buffer[currentCharacter++];
        }

        public int nextInt() {
            int c = nextToken();

            while (isSpaceCharacter(c)) {
                c = nextToken();
            }

            int sign = 1;
            if (c == '-') {
                c = nextToken();
                sign = -1;
            }

            int result = 0;
            do {
                if (!isNumber(c)) throw new InputMismatchException();
                result *= 10;
                result += c - '0';
                c = nextToken();
            } while (!isSpaceCharacter(c));

            return result;
        }

        private boolean isNumber(int c) {
            return c >= '0' && c <= '9';
        }

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

    }
}

