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.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;

public class T086D {
	static int BLOCK=555;
	static int[] a=new int[200_000],cnt=new int[1_000_001];
	static long[] ans=new long[200_000];
	static long answer=0;
	
	static class Node{
		int L,R,i;
	}
	static class Cmp implements Comparator<Node>{
		public int compare(Node a, Node b) {
			if(a.L/BLOCK<b.L/BLOCK)
				return -1;
			else if(a.L/BLOCK>b.L/BLOCK)
				return 1;
			else{
				if(a.R<b.R)
					return -1;
				else if(a.R>b.R)
					return 1;
				else
					return 0;
			}
		}
	}
	static void add(int pos){
		cnt[a[pos]]++;
		answer+=a[pos]*(((cnt[a[pos]]-1)<< 1)+1);
	}
	static void remove(int pos){
		cnt[a[pos]]--;
		answer-=a[pos]*(((cnt[a[pos]]+1)<< 1)-1);
	}
	public static void main(String[] args) {
		FastScanner in=new FastScanner();
		PrintWriter out=new PrintWriter(System.out);
		int i,n=in.nextInt(),m=in.nextInt();
		for(i=0;i<n;i++)
			a[i]=in.nextInt();
		Node[] q=new Node[m];
		for(i=0;i<m;i++){
			q[i]=new Node();
			q[i].L=in.nextInt()-1;
			q[i].R=in.nextInt()-1;
			q[i].i=i;
		}
		Arrays.sort(q,new Cmp());
		
		int curL=0,curR=0;
		for(i=0;i<m;i++){
			int L=q[i].L,R=q[i].R;
			while(curL<L){
				remove(curL);
				curL++;
			}
			while(curL>L){
				add(curL-1);
				curL--;
			}
			while(curR<=R){
				add(curR);
				curR++;
			}
			while(curR>R+1){
				remove(curR-1);
				curR--;
			}
			ans[q[i].i]=answer;
		}
		for(i=0;i<m;i++)
			out.println(ans[i]);
		out.flush();
	}
	
	static class FastScanner{
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(){br = new BufferedReader(new InputStreamReader(System.in));}
		String nextToken(){
			while(st == null||!st.hasMoreElements()){
				try{st = new StringTokenizer(br.readLine());}catch(Exception e){}
			}
			return st.nextToken();
		}
		int nextInt(){return Integer.parseInt(nextToken());}
		long nextLong(){return Long.parseLong(nextToken());}
		double nextDouble(){return Double.parseDouble(nextToken());}
	}
}
