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.util.*;
import java.io.*;
//example of Mo's Algorithm
public class PowerfulArray {
    static int[] cnt;
    static long curans = 0;
    public static void main(String[] args) {
        FastScanner scanner = new FastScanner();
        PrintWriter out = new PrintWriter(System.out, false);
        int n = scanner.nextInt();
        int t = scanner.nextInt();
        int[] arr = new int[n];
        cnt = new int[1_000_005];
        for(int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }
        int[][] ranges = new int[t][3];
        for(int i = 0; i < t; i++) {
            ranges[i][0] = scanner.nextInt()-1;
            ranges[i][1] = scanner.nextInt()-1;
            ranges[i][2] = i;
        }
        int blocksz = Math.max(n/((int)Math.sqrt(n) + 1), 1);
        Arrays.sort(ranges, new Comparator<int[]>() {
            @Override
            public int compare(int[] o1, int[] o2) {
                if (o1[0]/blocksz == o2[0]/blocksz) return o1[1] - o2[1];
                return o1[0]/blocksz - o2[0]/blocksz;
            }
        });
        long[] ans= new long[t];
        int curl = 0;
        int curr = 0;
        add(arr[0]);
        for(int[] rr: ranges) {
            int l = rr[0];
            int r = rr[1];
            while(curl < l) {
                rem(arr[curl]);
                curl++;
            }
            while(curl > l) {
                curl--;
                add(arr[curl]);
            }
            while(curr > r) {
                rem(arr[curr]);
                curr--;
            }
            while(curr < r) {
                curr++;
                add(arr[curr]);
            }
            ans[rr[2]] = curans;
        }
        for(long aa: ans) {
            out.println(aa);
        }
        out.flush();
    }
    static void add(int val) {
        //remove the current index
        curans -= (long)cnt[val] * cnt[val] * val;
        cnt[val]++;
        //add back in
        curans += (long)cnt[val] * cnt[val] * val;
    }
    static void rem(int val) {
        //remove the current index
        curans -= (long)cnt[val] * cnt[val] * val;
        cnt[val]--;
        //add back in
        curans += (long)cnt[val] * cnt[val] * val;
    }
    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        
        public FastScanner(Reader in) {
            br = new BufferedReader(in);
        }
        
        public FastScanner() {
            this(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 readNextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
