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.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
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;
        FastScanner in = new FastScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        final int BLOCKSIZE = 1200;

        public void solve(int testNumber, FastScanner in, PrintWriter out) {
            int n = in.nextInt();
            int numQueries = in.nextInt();
            int[] a = new int[n];
            int max = 0;
            for (int i = 0; i < n; i++) {
                a[i] = in.nextInt();
                max = Math.max(max, a[i]);
            }
            Query[] queries = new Query[numQueries];
            long[] ans = new long[numQueries];
            for (int i = 0; i < numQueries; i++) {
                queries[i] = new Query();
                queries[i].l = in.nextInt() - 1;
                queries[i].r = in.nextInt();
                queries[i].id = i;
            }
            PowerfulSet s = new PowerfulSet(max + 1);
            Arrays.sort(queries);
            int l = 0;
            int r = 0;
            for (Query q : queries) {
                while (l > q.l) {
                    --l;
                    s.add(a[l]);
                }
                while (l < q.l) {
                    s.remove(a[l]);
                    ++l;
                }
                while (r > q.r) {
                    --r;
                    s.remove(a[r]);
                }
                while (r < q.r) {
                    s.add(a[r]);
                    ++r;
                }
                ans[q.id] = s.val;
            }
            for (int i = 0; i < numQueries; i++) {
                out.println(ans[i]);
            }
        }

        class Query implements Comparable<Query> {
            int l;
            int r;
            int id;

            public int compareTo(Query o) {
                int block1 = l / BLOCKSIZE;
                int block2 = o.l / BLOCKSIZE;
                if (block1 != block2) {
                    return block1 < block2 ? -1 : 1;
                }
                if (r != o.r) {
                    return r < o.r ? -1 : 1;
                }
                return 0;
            }

        }

        class PowerfulSet {
            long val;
            int[] a;

            PowerfulSet(int max) {
                val = 0;
                a = new int[max];
            }

            void add(int x) {
                val += (long) x * (2 * a[x] + 1);
                ++a[x];
            }

            void remove(int x) {
                val -= (long) x * (2 * a[x] - 1);
                --a[x];
            }

        }

    }

    static class FastScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public FastScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

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

    }
}

