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;

/**
 * Created by mostafa on 10/31/17.
 */
public class PowerfulArray {

    static int n;
    static int k;
    static int[] a, occ;
    static long ans;
    static class Query implements Comparable<Query>{
        int l, r, i;
        Query(int a, int b, int c) {
            l = a; r = b; i = c;
        }

        @Override
        public int compareTo(Query q) {
            int b1 = l / k, b2 = q.l / k;
            if(b1 == b2)
                return r - q.r;
            return b1 - b2;
        }
    }
    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner();
        n = sc.nextInt();
        k = (int) Math.sqrt(n);
        int t = sc.nextInt();
        a = new int[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextInt();
        int max = (int) 1e6 + 1;
        occ = new int[max];
        Query[] q = new Query[t];
        for(int i = 0; i < t; i++)
            q[i] = new Query(sc.nextInt() - 1, sc.nextInt() - 1, i);
        Arrays.sort(q);
        int l = 0, r = 0;
        long[] answer = new long[t];
        for(int i = 0; i < t; i++) {
            int curL = q[i].l, curR = q[i].r;
            while(l < curL)
                rem(l++);
            while(l > curL)
                add(--l);
            while(r <= curR)
                add(r++);
            while(r > curR + 1)
                rem(--r);
            answer[q[i].i] = ans;
        }
        PrintWriter out = new PrintWriter(System.out);
        for(int i = 0; i < t; i++)
            out.println(answer[i]);
        out.flush();
        out.close();
    }

    static void add(int i) {
        ans +=  1l * a[i] * (((++occ[a[i]]) << 1) - 1);
    }

    static void rem(int i) {
        ans -= 1l * a[i] * (((occ[a[i]]--) << 1) - 1);
    }

    static class Scanner {
        BufferedReader br;
        StringTokenizer st;
        Scanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        Scanner(String f) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(f));
        }

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

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

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

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