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

// package MoAlgorithmn;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;

public class PowerFullArray {
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String line[]=br.readLine().split(" ");
        int n=Integer.parseInt(line[0]);
        int q=Integer.parseInt(line[1]);
        int a[]=new int[n];
        line=br.readLine().split(" ");
        for(int i=0;i<n;i++){
            a[i]=Integer.parseInt(line[i]);
        }
        ArrayList<Query2> queries=new ArrayList<>();
        int sqrt=(int)Math.ceil(Math.sqrt(n));
        for(int i=1;i<=q;i++){
            line=br.readLine().split(" ");
            int l=Integer.parseInt(line[0])-1;
            int r=Integer.parseInt(line[1])-1;
            Query2 temp=new Query2(l,r,l/sqrt,i);
            queries.add(temp);
        }
        Collections.sort(queries);
        int freq[]=new int[1000001];
        long ans[]=new long[q+1];
        int left=queries.get(0).l;
        int right=queries.get(0).l;
        freq[a[left]]++;
        long count=a[left];
        for(int i=0;i<q;i++){
            Query2 query=queries.get(i);
            int l=query.l;
            int r=query.r;
            if(left<l){
               while(left!=l){
                   count-=1l*a[left]*freq[a[left]]*freq[a[left]];
                   freq[a[left]]--;
                   count+=1l*a[left]*freq[a[left]]*freq[a[left]];
                   left++;
               }
            }
            if(left>l){
                while(left!=l){
                    left--;
                    count-=1l*a[left]*freq[a[left]]*freq[a[left]];
                    freq[a[left]]++;
                    count+=1l*a[left]*freq[a[left]]*freq[a[left]];
                }
            }
            if(right<r){
                while(right!=r){
                    right++;
                    count-=1l*a[right]*freq[a[right]]*freq[a[right]];
                    freq[a[right]]++;
                    count+=1l*a[right]*freq[a[right]]*freq[a[right]];
                }
            }
            if(right>r){
                while(right!=r){
                    count-=1l*a[right]*freq[a[right]]*freq[a[right]];
                    freq[a[right]]--;
                    count+=1l*a[right]*freq[a[right]]*freq[a[right]];
                    right--;
                }
            }
            ans[query.index]=count;
        }
        StringBuilder print=new StringBuilder();
        for(int i=1;i<=q;i++){
            print.append(ans[i]+"\n");
        }
        System.out.print(print.toString());
    }
}


class Query2 implements Comparable<Query2>{
    int l,r,l_block,index;
    public Query2(int l,int r,int l_block,int index){
        this.l=l;
        this.r=r;
        this.l_block=l_block;
        this.index=index;
    }

    @Override
    public int compareTo(Query2 o) {
        if(this.l_block!=o.l_block){
            return this.l_block-o.l_block;
        }
        else{
            return this.r-o.r;
        }
    }
}
