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.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.util.Random;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        DPowerfulArray solver = new DPowerfulArray();
        solver.solve(1, in, out);
        out.close();
    }

    static class DPowerfulArray {
        int magic;
        long[] count;
        long currentAns;

        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int n = in.scanInt();
            int t = in.scanInt();
            int[] ar = new int[n];
            count = new long[1000005];
            magic = 3000;
            for (int i = 0; i < n; i++) ar[i] = in.scanInt();
            int[][] queries = new int[t][4];
            for (int i = 0; i < t; i++) {
                queries[i][0] = in.scanInt() - 1;
                queries[i][1] = in.scanInt() - 1;
                queries[i][2] = i;
                queries[i][3] = queries[i][0] / magic;
            }
            CodeHash.shuffle(queries);
            Arrays.sort(queries, (o1, o2) -> {
                if (o1[3] != o2[3]) return o1[3] - o2[3];
                return o1[1] - o2[1];
            });
            int leftPtr = 0;
            int rightPtr = 0;
            long[] ans = new long[t];
            for (int i = 0; i < t; i++) {
                int lr = queries[i][0];
                int rr = queries[i][1];
                while (leftPtr < lr) {
                    int element = (ar[leftPtr++]);
                    currentAns -= element * (count[element] + count[element] - 1);
                    count[element]--;
                }
                while (leftPtr > lr) {
                    int element = (ar[--leftPtr]);
                    currentAns += element * (count[element] + count[element] + 1);
                    count[element]++;
                }
                while (rightPtr <= rr) {
                    int element = (ar[rightPtr++]);
                    currentAns += element * (count[element] + count[element] + 1);
                    count[element]++;
                }
                while (rightPtr > rr + 1) {
                    int element = (ar[--rightPtr]);
                    currentAns -= element * (count[element] + count[element] - 1);
                    count[element]--;
                }
                ans[queries[i][2]] = currentAns;
            }
            for (long l : ans) out.println(l);


        }

    }

    static class CodeHash {
        public static void shuffle(int[][] ar) {
            Random rd = new Random(new Random().nextInt());
            for (int i = 0; i < ar.length; i++) {
                int index = rd.nextInt(ar.length);
                int[] temp = ar[i];
                ar[i] = ar[index];
                ar[index] = temp;
            }
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

