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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class SolutionD extends Thread {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                                            InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    private static final FastReader scanner = new FastReader();
    private static final PrintWriter out = new PrintWriter(System.out);

    public static void main(String[] args) {
        solve();
        out.close();
    }

    static int n;

    static class Query implements Comparable<Query> {
        int l;
        int r;
        int index;
        int bucket;
        long result = 0;

        public Query(int index, int l, int r) {
            this.index = index;
            this.l = l;
            this.r = r;
            bucket = l / (int) Math.sqrt(n);
        }

        @Override
        public int compareTo(Query o) {
            if (this.bucket == o.bucket) {
                return this.r - o.r;
            }
            return this.bucket - o.bucket;
        }
    }

    private static void solve() {
        n = scanner.nextInt();
        int t = scanner.nextInt();

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



        Query[] queries = new Query[t];

        for (int i = 0; i < t; i++) {
            int l = scanner.nextInt() - 1;
            int r = scanner.nextInt();
            queries[i] = new Query(i, l, r);

            if (n == 1) {
                out.println(a[0]);
            }
        }
        if (n == 1) {
            return;
        }

        Arrays.sort(queries);

        int leftPointer = 0;
        int rightPointer = 0;
        int[] distr = new int[1_000_001];
        long result = 0;

        for (Query query: queries) {
            while (leftPointer > query.l) {
                leftPointer--;
                distr[a[leftPointer]]++;
                result += a[leftPointer] * (2L * distr[a[leftPointer]] - 1);
            }

            while (rightPointer < query.r) {
                distr[a[rightPointer]]++;
                result += a[rightPointer] * (2L * distr[a[rightPointer]] - 1);
                rightPointer++;
            }

            while (rightPointer > query.r) {
                rightPointer--;
                result -= a[rightPointer] * (2L * distr[a[rightPointer]] - 1);
                distr[a[rightPointer]]--;
            }

            while (leftPointer < query.l) {
                result -= a[leftPointer] * (2L * distr[a[leftPointer]] - 1);
                distr[a[leftPointer]]--;
                leftPointer++;
            }
            query.result = result;
        }

        Arrays.sort(queries, Comparator.comparingLong(o -> o.index));
        Arrays.stream(queries).forEach(query -> out.println(query.result));
    }
}