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.*;
import java.math.*;
     
public class Main{
	public static void main(String[] args) throws Exception {
	IO io = new IO();
	PrintWriter out = new PrintWriter(System.out);
	Solver sr = new Solver();
	sr.solve(io,out);
	out.flush();
	out.close();
    	}

	static class Solver
	{
	    class Pair
	    {
	        int l, r, id, block;
	        public Pair(int a, int b, int c)
	        {
	            l=a;
	            r=b;
	            id=c;
	            block =a/bsize;
	        }
	    }
	    int[] ar;
	    int[] count;
	    int bsize;
	    long sol;
	    void delete(int ar)
	    {
	        sol-=(2*count[ar]-1)*ar;
	        count[ar]--;
	    }
	    void add(int ar)
	    {
	        count[ar]++;
	        sol+=(2*count[ar]-1)*ar;
	    }
      	void solve(IO io, PrintWriter out)
	    {
	        int n = io.nextInt();
	        int q = io.nextInt();
	        
	        ar = new int[n];
	        Pair[] qq = new Pair[q];
	        count = new int[1000001];
	        
	        for(int i=0 ; i<n ; i++)
	            ar[i] = io.nextInt();
	            
	        bsize = (int)Math.sqrt(n);
	        //out.println(bsize);
	        for(int i=0 ; i<q ; i++)
	        {
	            qq[i] = new Pair(io.nextInt()-1,io.nextInt()-1,i);
	            //out.println(qq[i].l+" "+qq[i].r+" "+qq[i].block);
	        }
	        
	        Arrays.sort(qq , new Comparator<Pair>(){
    	        public int compare(Pair a, Pair b)
        	    {
        	        if(a.block==b.block)
        	            return a.r-b.r;
        	        return a.block-b.block;
        	    }
	        });
	        
	        long ans[] = new long[q];
	        sol=0;
	        int l=0, r=0;
	        add(ar[l]);
	        for(int i=0 ; i<q ; i++)
	        {
	            int lx = qq[i].l;
	            int rx = qq[i].r;
	            
	            while(lx>l)
	                delete(ar[l++]);
	            while(lx<l)
	                add(ar[--l]);
	            while(rx>r)
	                add(ar[++r]);
	            while(rx<r)
	                delete(ar[r--]);
	            ans[qq[i].id] = sol;
	        }
	        for(int i=0 ; i<q ; i++)
	            out.println(ans[i]);
	    }
    	
	}
	//Special thanks to Petr (on codeforces) who inspired me to implement IO class!
	static class IO
	{
    	BufferedReader reader;
        StringTokenizer tokenizer;
    	public IO() {
                reader = new BufferedReader(new InputStreamReader(System.in));
                tokenizer = null;
            }
     
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public String nextLine() {
            String s="";
            try {
                    s=reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            return s;
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
    
        public long nextLong() {
            return Long.parseLong(next());
        }
    	double nextDouble()
    	{
    		return Double.parseDouble(next());
    	}
	}
}