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 Task5 {
    int[][] intervals;
    int[] ar;
    long[] res;
    int n;
    int sqrt;

    public static void main(String[] args) throws IOException {
        new Task5().solve();
    }

    private void solve() throws IOException {
        BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);

        StringTokenizer tokenizer = new StringTokenizer(f.readLine());
        n = Integer.parseInt(tokenizer.nextToken());
        int t = Integer.parseInt(tokenizer.nextToken());
        ar = new int[n];
        tokenizer = new StringTokenizer(f.readLine());
        for (int i = 0; i < n; i++) {
            ar[i] = Integer.parseInt(tokenizer.nextToken());
        }


        this.sqrt = (int) Math.sqrt(n);
        intervals = new int[t][3];
        res = new long[t];
        for (int t1 = 0; t1 < t; t1++) {
            tokenizer = new StringTokenizer(f.readLine());
            int l = Integer.parseInt(tokenizer.nextToken()) - 1;
            int r = Integer.parseInt(tokenizer.nextToken()) - 1;
            intervals[t1][0] = l;
            intervals[t1][1] = r;
            intervals[t1][2] = t1;
        }
        Arrays.sort(intervals, new ArrayComparator());
        checkAll();

        for (int t1 = 0; t1 < t; t1++) out.println(res[t1]);

        out.close();
    }

    class ArrayComparator implements Comparator<int[]> {
        @Override
        public int compare(int[] ints, int[] t1) {
            int block1 = ints[0] / sqrt;
            int block2 = t1[0] / sqrt;
            if (block1 != block2) return Integer.compare(block1, block2);
            return Integer.compare(ints[1], t1[1]);
        }
    }


    void checkAll() {
        int[] freq = new int[1000001];
        int a = 0;
        int b = 0;
        freq[ar[a]] = 1;
        long curr = ar[a] * 1;
        for (int[] interval : intervals) {
            while (interval[1] > b) {
                b++;
                curr -= valueOfIndex(b, freq);
                freq[ar[b]]++;
                curr += valueOfIndex(b, freq);
            }
            while (interval[1] < b) {
                curr -= valueOfIndex(b, freq);
                freq[ar[b]]--;
                curr += valueOfIndex(b, freq);
                b--;
            }

            while (interval[0] > a) {
                curr -= valueOfIndex(a, freq);
                freq[ar[a]]--;
                curr += valueOfIndex(a, freq);
                a++;
            }
            while (interval[0] < a) {
                a--;
                curr -= valueOfIndex(a, freq);
                freq[ar[a]]++;
                curr += valueOfIndex(a, freq);
            }

            res[interval[2]] = curr;
        }
    }

    long valueOfIndex(int index, int[] freq) {
        return (long) freq[ar[index]] * freq[ar[index]] * ar[index];
    }

    static void add(HashMap<Integer, Integer> map, int num) {
        if (!map.containsKey(num)) map.put(num, 1);
        else map.put(num, map.get(num) + 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

 */

/*
10 5
10 9 8 7 6 5 4 3 2 1
4 8
1 10
3 9
2 2
5 10
 */

/*
4 1
3 3 3 3
1 4
 */

/*
3 2
1 2 1
2 3

 */

/*
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
 */

