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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Vikash Kumar
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        Codeforces solver = new Codeforces();
        solver.solve(1, in, out);
        out.close();
    }

    static class Codeforces {
        long total = 0;

        public void solve(int testNumber, InputReader in, OutputWriter out) throws IndexOutOfBoundsException {
            int n = in.ni();
            int q = in.ni();
            int[] arr = in.nia(n);
            long[] answer = new long[q];
            Codeforces.index[] query = new Codeforces.index[q];
            for (int i = 0; i < q; i++) {
                int l = in.ni() - 1;
                int r = in.ni() - 1;
                //out.println(l + " query " + r);
                query[i] = new Codeforces.index(l, r, i);
            }
            int block = (int) Math.sqrt(2 * n);
            Arrays.sort(query, new Comparator<Codeforces.index>() {

                public int compare(Codeforces.index o1, Codeforces.index o2) {
                    if ((o1.l / block) < (o2.l / block)) {
                        return -1;
                    } else if ((o1.l / block) > (o2.l / block)) {
                        return 1;
                    } else {
                        if (o1.r < o2.r) {
                            return -1;
                        } else if (o1.r > o2.r) {
                            return 1;
                        }
                        return 0;
                    }
                }
            });
            HashSet<Integer> set = new HashSet<>();
            int l = 0;
            int r = n - 1;
            long[] count = new long[1000001];
            for (int i = 0; i < n; i++) {
                count[arr[i]]++;
            }
            for (int i = 0; i < n; i++) {
                if (!set.contains(arr[i])) {
                    total += (count[arr[i]] * count[arr[i]]) * arr[i];
                    set.add(arr[i]);
                    //out.println(total+" total "+arr[i]+" "+count[arr[i]]);
                }
            }
            //out.println(total+" hello ");
//        for (int i = 0; i < 4; i++) {
//            out.print(count[i] + " ");
//        }
//        out.println();
            for (int i = 0; i < q; i++) {
                int currl = query[i].l;
                int currr = query[i].r;
                while (currl < l) {
                    add(count, arr, l - 1);
                    l--;
                }
                while (currl > l) {
                    remove(count, arr, l);
                    l++;
                }
                while (currr > r) {
                    add(count, arr, r + 1);
                    r++;
                }
                while (currr < r) {
                    remove(count, arr, r);
                    r--;
                }
                //out.println(l+" "+r+" "+total);
                answer[query[i].ind] = total;
            }
            for (int i = 0; i < q; i++) {
                out.println(answer[i]);
            }
        }

        void add(long[] count, int[] arr, int pos) {
            count[arr[pos]]++;
            //System.out.println(total+" add_before "+pos);
            total += (count[arr[pos]] * count[arr[pos]] -
                    (count[arr[pos]] - 1) * (count[arr[pos]] - 1)) * (long) arr[pos];
            //System.out.println(total+" add "+arr[pos]);
        }

        void remove(long[] count, int[] arr, int pos) {
            count[arr[pos]]--;
            //System.out.println(total+" remove_before "+pos);
            total -= ((count[arr[pos]] + 1) * (count[arr[pos]] + 1)
                    - count[arr[pos]] * count[arr[pos]]) * (long) arr[pos];
            //System.out.println(total+" remove "+arr[pos]);
        }

        static class index {
            int l;
            int r;
            int ind;

            public index(int l, int r, int ind) {
                this.l = l;
                this.r = r;
                this.ind = ind;
            }

        }

    }

    static class InputReader {
        private BufferedReader br;
        private StringTokenizer st;

        public InputReader(InputStream inputStream) {
            br = new BufferedReader(new InputStreamReader(inputStream));
        }

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

        public int ni() {
            return Integer.parseInt(n());
        }

        public int[] nia(int n) {
            int[] array = new int[n];
            for (int i = 0; i < n; ++i) array[i] = ni();
            return array;
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(long i) {
            writer.println(i);
        }

    }
}

