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.*;
import java.util.*;

/**
 * https://www.spoj.com/problems/RMQSQ/
 */
public class MOAlgorithm{
    static class Reader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public Reader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(reader.readLine());

                }
            } catch (IOException e) {
                return null;
            }
            return tokenizer.nextToken();
        }

        public String nextLine() {
            String line = null;
            try {
                tokenizer = null;
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

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

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

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

        public boolean hasNext() {
            try {
                while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                    tokenizer = new StringTokenizer(reader.readLine());
                }
            } catch (Exception e) {
                return false;
            }
            return true;
        }
    }

    static Reader sc = new Reader(System.in);
    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    static int blockSize;
    public static void main(String[] args) throws IOException{
        int n = sc.nextInt();
        int q = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++)
            arr[i] = sc.nextInt();

        blockSize = (int) Math.floor(Math.sqrt(n));
        int blocks = (int) Math.ceil(n / (blockSize * 1.0f));
        // System.out.println("Blocksize: "+blockSize+" No of blocks: "+blocks);
        ArrayList<Query> queries = new ArrayList<>();
        for(int i = 0;i < q;i++) {
            int l = sc.nextInt();
            int r = sc.nextInt();
            queries.add(new Query(l, r, i));
        }
        Collections.sort(queries);
        solve(queries, arr);
    }

    static void solve(ArrayList<Query> queries, int[] arr) {
        long[] ans = new long[queries.size()];
        int currL = 0;
        int currR = -1;
        long sum = 0L;
        int[] freq = new int[1000001];
        for(int j = 0;j < queries.size();j++){
            int l = queries.get(j).l;
            int r = queries.get(j).r;
            l--;r--;
            while(currL > l){
                currL--;
                int x = arr[currL];
                sum -= (long)x * freq[x] * freq[x];
                freq[x]++;
                sum += (long)x * freq[x] * freq[x];
            }
            while (currR < r) {
                currR++;
                int x = arr[currR];
                sum -= (long)x * freq[x] * freq[x];
                freq[x]++;
                sum += (long)x * freq[x] * freq[x];
            }
            while(currR > r){
                int x = arr[currR];
                currR--;
                sum -= (long)x * freq[x] * freq[x];
                freq[x]--;
                sum += (long)x * freq[x] * freq[x];
            }
            while (currL < l) {
                int x = arr[currL];
                currL++;
                sum -= (long)x * freq[x] * freq[x];
                freq[x]--;
                sum += (long)x * freq[x] * freq[x];
            }
            ans[queries.get(j).idx] = sum;
            // System.out.println("l: " + l + " r:" + r+" sum:"+sum+" curl: "+currL+" currR: "+currR);
        }
        StringBuilder sb = new StringBuilder();
        for(int i = 0;i < ans.length;i++)
            sb.append(ans[i]+"\n");
        System.out.print(sb.toString());
    }

    static class Query implements Comparable<Query> {
        int l;
        int r;
        int idx;

        public Query(int l, int r, int idx) {
            this.l = l;
            this.r = r;
            this.idx = idx;
        }

        @Override
        public int compareTo(Query o) {
            if (this.l / blockSize == o.l / blockSize) {
                return this.r - o.r;
            } else
                return this.l / blockSize - o.l / blockSize;
        }

        @Override
        public String toString() {
            return "{l: "+l+" r: "+r+"}";
        }
    }
}