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

 public  class Mkkkkeain{
    static int n, t;
    final static int rt = 430;
    static int s[], freq[];
    static Query q[];
    static long value, ans[];

    public static void main(String args[]) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        s = new int[200005];
        freq = new int[1000005];
        ans = new long[200005];

        int n = in.nextInt();
        int t = in.nextInt();
        for(int i = 1; i <= n; i++) s[i] = in.nextInt();

        q = new Query[t];
        for(int i = 1; i <= t; i++){
            int l, r;
            l = in.nextInt();
            r = in.nextInt();
            q[i - 1] = new Query(l, r, i);
        }
        Arrays.sort(q);

        value = 0;
        int lp = 1, rp = 0;
        for(int i = 1; i <= t; i++){
            Query v = q[i - 1];
            while(lp < v.l) subtract(s[lp++]);
            while(lp > v.l) add(s[--lp]);
            while(rp < v.r) add(s[++rp]);
            while(rp > v.r) subtract(s[rp--]);
            ans[v.id] = value;
        }
        for(int i = 1; i <= t; i++) out.println(ans[i]);
        out.close();
    }

    public static void add(int pos){
        value += (long)pos * (freq[pos] + freq[pos] + 1);
        freq[pos]++;
    }
    public static void subtract(int pos){
        value -= (long)pos * (freq[pos] + freq[pos] - 1);
        freq[pos]--;
    }

    static class Query implements Comparable<Query>{
        int l, r, id;
        public Query(int l, int r, int id){
            this.l = l;
            this.r = r;
            this.id = id;
        }
        public int compareTo(Query k){
            if(l / rt == k.l / rt) return r - k.r;
            else return l - k.l;
        }
    }
}