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.*;

public class YanAlgo2011R2QDPowerfulArray {

	static int n,t;
	static int a[],count[];
	static Query q[];
	static long ans;
	static long qans[];
	
	public static void main(String args[] ) throws Exception {
		
		InputReader2 in = new InputReader2(System.in);
	    PrintWriter w = new PrintWriter(System.out);
	        
	    n = in.nextInt();
	    t = in.nextInt();
	          
	    a = new int[n];
	    for(int i=0;i<n;i++)
	    	a[i] = in.nextInt();
	        
	    count = new int[1000001];
	    ans = 0;
	    q = new Query[t];
	    Query.nsqrt = (int)(Math.sqrt(n));
	    qans = new long[t];
	    
	    for(int i=0;i<t;i++){
	    	int l = in.nextInt() - 1;
	    	int r = in.nextInt() - 1;
	    	q[i] = new Query(l,r,i);
	    }
	    
	    Arrays.sort(q);
	    int left = 0,right = -1;
	    
	    for(int i=0;i<t;i++){
	    	int x = q[i].l;
	    	int y = q[i].r;
	    	
	    	while(left < x)
	    		remove(a[left++]);
	    	
	    	while(left > x)
	    		add(a[--left]);
	    	
	    	while(right < y)
	    		add(a[++right]);
	    	
	    	while(right > y)
	    		remove(a[right--]);
	    	
	    	qans[q[i].id] = ans;
	    }
	   
	    for(long i : qans)
	    	w.println(i);
	    w.close(); 
	}
	
	public static void add(int val){
		ans += val * (count[val] + count[val] + 1);
		count[val]++;
	}
	
	public static void remove(int val){
		ans -= val * (count[val] + count[val] - 1);
		count[val]--;
	}
	
	public static int ip(String s){
		return Integer.parseInt(s);
	}
}


class Query implements Comparable<Query>{
	int l,r,block,id;
	static int nsqrt;
	
	public Query(int l,int r,int id){
		this.l = l;
		this.r = r;
		block = l / nsqrt ;
		this.id = id;
	}
	
	public int compareTo(Query b){
		if(block != b.block)
			return block - b.block;
		return r - b.r;
	}
	
	public String toString(){
		return id + " " + l + " " + r + " " + block;
	}
}

class InputReader2 {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;
	public InputReader2(InputStream stream) {
		this.stream = stream;
	}
	
	public int snext() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int nextInt() {
		int c = snext();
		while (isSpaceChar(c))
			c = snext();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = snext();
		}

		int res = 0;

		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = snext();
		} while (!isSpaceChar(c));

		return res * sgn;
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}