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

/*
 * @author derrick20
 */
import java.io.*;
import java.util.*;

public class MoAlgorithm {
    public static void main(String args[]) throws Exception {
        FastScanner sc = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int N = sc.nextInt();
        int Q = sc.nextInt();
        size = (int) (N / Math.sqrt(Q)) + 1;
//        size = (int) Math.sqrt(N) + 1;
        arr = new int[N];
        int maxVal = 0;
        for (int i = 0; i < N; i++) {
            arr[i] = sc.nextInt();
            if (arr[i] > maxVal) {
                maxVal = arr[i];
            }
        }

        ArrayList<Query> queries = new ArrayList<>();
        for (int i = 0; i < Q; i++) {
            int l = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            queries.add(new Query(i, l, r));
        }
        Collections.sort(queries);
        long[] answers = new long[Q];
        freqMap = new int[maxVal + 1];
        int left = 0;
        int right = 0;
        runningAns = arr[0];
        freqMap[arr[0]] = 1;
        for (Query q : queries) {
            int l = q.l;
            int r = q.r;

            while (left < l) {
                remove(left++);
            }
            while (left > l) {
                add(--left);
            }
            while (right < r) {
                add(++right);
            }
            while (right > r) {
                remove(right--);
            }
            answers[q.id] = runningAns;
        }
        for (int i = 0; i < answers.length; i++) {
            out.println(answers[i]);
        }
        out.close();
    }

    static int[] freqMap;
    static int[] arr;
    static int size;
    static long runningAns;

    static void add(int i) {
        int oldFreq = freqMap[arr[i]];
        runningAns += arr[i] * (2 * oldFreq + 1);
        freqMap[arr[i]]++;
    }

    static void remove(int i) {
        int oldFreq = freqMap[arr[i]];
        runningAns += arr[i] * (-2 * oldFreq + 1);
        freqMap[arr[i]]--;
    }

//    static void update(int val, int delta) {
//        if (freqMap.containsKey(val)) {
//            if (delta > 0) {
//                freqMap.put(val, freqMap.get(val) + 1);
//            }
//            else {
//                freqMap.put(val, freqMap.get(val) + 1);
//                if (freqMap.get(val) == 0) {
//                    freqMap.remove(val);
//                }
//            }
//        }
//        else {
//            if (delta > 0) {
//                freqMap.put(val, 1);
//            }
//            else {}
//        }
//    }

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

        public Query(int i, int ll, int rr) {
            id = i;
            l = ll;
            r = rr;
            block = l / size;
        }

        public int compareTo(Query q2) {
            if (block != q2.block) {
                return block - q2.block;
            }
            else {
                // We alternate from increasing to decreasing r
                // to further boost us
                return (r - q2.r) * (block % 2 == 0 ? 1 : -1);
            }
        }
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        FastScanner(FileReader s) {
            br = new BufferedReader(s);
        }

        String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        String nextLine() throws IOException {
            return br.readLine();
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

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

        long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }
}