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


public class Main {

    static int s;

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = sc.nextInt();
        int t = sc.nextInt();
        int[] a = sc.nextIntArray(n);
        s = (int) (Math.sqrt(n) + 1);
        Query queries[] = new Query[t];
        for (int i = 0; i < t; i++)
            queries[i] = new Query(sc.nextInt() - 1, sc.nextInt() - 1, i);
        int left = -1, right = -1;
        Arrays.sort(queries);
        long[] ans = new long[t];
        Counter counter = new Counter(n, a);
        for (int i = 0; i < t; i++) {
            int qleft = queries[i].l;
            int qright = queries[i].r;
            while (left > qleft) counter.add(--left);
            while (right > qright) counter.remove(right--);
            while (right < qright) counter.add(++right);
            while (left < qleft) counter.remove(left++);
            ans[queries[i].idx] = counter.ans;

        }
        for (long x : ans)
            out.println(x);
        out.close();
        out.flush();

    }

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

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

        @Override
        public int compareTo(Query o) {
            return leftBlock == o.leftBlock ? r - o.r : leftBlock - o.leftBlock;

        }
    }

    static class Counter {
        static final int max = (int) (1e6 + 1);
        int n, a[], cnt[];
        long ans;
        boolean[] taken;

        public Counter(int n, int[] a) {
            this.n = n;
            this.a = a;
            cnt = new int[max];
            taken = new boolean[n];
        }

        void add(int idx) {
            if (taken[idx]) return;
            int val = a[idx];
            int oldocc = cnt[val]++;
            ans += 1l * val * (2 * oldocc + 1);
            taken[idx] = true;
        }

        void remove(int idx) {
            if (idx == -1) return;
            if (!taken[idx]) return;
            int val = a[idx];
            int oldocc = cnt[val]--;
            ans -= 1l * val * (2 * oldocc - 1);
            taken[idx] = false;
        }
    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream system) {
            br = new BufferedReader(new InputStreamReader(system));
        }

        public Scanner(String file) throws Exception {
            br = new BufferedReader(new FileReader(file));
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

        public String nextLine() throws IOException {
            return br.readLine();
        }

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

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

        public char nextChar() throws IOException {
            return next().charAt(0);
        }

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

        public boolean ready() throws IOException {
            return br.ready();
        }

        public void waitForInput() throws InterruptedException {
            Thread.sleep(3000);
        }

        public int[] nextIntArray(int n) throws IOException {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        public long[] nextLongArray(int n) throws IOException {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }


        public Integer[] nextIntegerArray(int n) throws IOException {
            Integer[] a = new Integer[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }

        public double[] nextDoubleArray(int n) throws IOException {
            double[] ans = new double[n];
            for (int i = 0; i < n; i++)
                ans[i] = nextDouble();
            return ans;
        }

        public short nextShort() throws IOException {
            return Short.parseShort(next());
        }

    }

}