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

/*
                              _                     _ 
                              _                     _ 
                            _ / |                 | \ _ 
                            _ / |         _       | \ _ 
                        _ / _   |       _ | \\    |   _ \ 
                        _ / _   |       _ | \ \   |   _ \ 
                    _ / _ / |   /     /         \ \   | \ _ \ _ 
                    _ / _ / |   /     /          \ \   | \ _ \ _ 
                _ / _ /     | /     /     _       \ \ |     \ _ \ _   
               _ / _ /      | /     /     _       \ \ |      \ _ \ _   
            _ / _ /         | |     |   |   \  O  / | |         \ _ \ _ 
           _ / _ /          | |     |   |    \   /  | |          \ _ \ _ 
          / _ /     |   |   | \     |   \ _   \|/   / |   |   |     \ _ \ 
         / _ /      |   |   | \     |   \ _    V    / |   |   |      \ _ \ 
        / /         |   |   |   \ _ /       \ _ _ /   |   |   |         \ \ 
       / /          |   |   |                         |   | | |          \ \ 
      / /       |   | | \     \       ROWECHEN      /     / | |   |       \ \ 
     / /    _ _ |   | | \     \        ZHONG        /     / | |   | _ _    \ \ 
    / / _ /   \ | | | |   \ / \ \                 / / \ /   | | | | /   \ _ \ \ 
   / / _ /    \ | | | |       \ \                 / /       | | | | /    \ _ \ \ 
  / / /         \ \ \ \ /       /                 \       \ / / / /         \ \ \ 
 \ / /          \ \ \ \ /       /                 \       \ / / / /          \ \ / 
  \|/             \|/         |         |         |           \|/             \|/ 
                  \|/         |         |   |     |           \|/ 
                              / _ |     |   | _     \ 
                              / _ |     |   | _     \ 
                            / / / _     | _ | | \ _   \ 
                            / / / _ |   | _ | | \ _   \ 
                            | / / | | / | | \ / | | \ | 
                            | / / | | / | | \ / | | \ |         
                              /   \ / | | | / | | / \ /           
                              /   \ / | | | / | | / \/           
                                  / | / \ |   \ /           
                                  / | / \ |    \/   
                                  \ /     |                                   
                                  \/      |                                                                   
*/
//TEMPLATE V2
	import java.io.*;
	import java.util.*;
	import java.math.*;
	
public class Main {
//Solution goes below: ------------------------------------

	static int[] a,count;
	static long ans;
	static Query[] q;
	static long[] qans;

	public static void solution() throws IOException {
		
		int n=nextInt(),t=nextInt();
		a=new int[n];
		for(int i=0;i<n;i++){
			a[i]=nextInt();
		}
		count=new int[(int)1e6+1];//There's only 1e6 possible values...
		ans=0;
		q=new Query[t];

		Query.sqrt=(int)Math.sqrt(n);//Moe's alg. O(sqrtn)

		for(int i=0;i<t;i++){
			q[i]=new Query(nextInt()-1,nextInt()-1,i);
		}
		Arrays.sort(q);//Note that this optimizes Moe's.
		qans=new long[t];
		int left=0,right=-1;

		for(int i=0;i<t;i++){//Shift for the query.
			while (left < q[i].l){
				remove(a[left]);
				left++;
			}
			while (left > q[i].l){
				left--;
				add(a[left]);
			}
			while (right < q[i].r){
				right++;
				add(a[right]);
			}
			while (right > q[i].r){
				remove(a[right]);
				right--;
			} 
			qans[q[i].id] = ans;
		}
		for(long i:qans){
			println(i);
		}
	}

	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]--;
	}
	
	static class Query implements Comparable<Query>{
		int l,r,block,id;
		static int sqrt;
	
		public Query(int l,int r,int id){
			this.l = l;
			this.r = r;
			block = l / sqrt ;
			this.id = id;
		}
	
		public int compareTo(Query b){
			if(block != b.block)
				return block - b.block;
			return r - b.r;
		}
	}

//Solution goes above: ------------------------------------
	public static final String IN_FILE = "";
	public static final String OUT_FILE = "";
//-------------------- ------------------------------------
	//IO
	public static BufferedReader br;
	public static StringTokenizer st;
	public static BufferedWriter bw;
    public static void main(String[] args) throws IOException{
		if(IN_FILE==""){
			br = new BufferedReader(new InputStreamReader(System.in)); 
		}else{
			try {
				br = new BufferedReader(new FileReader(IN_FILE));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
		}
		if (OUT_FILE==""){
			bw = new BufferedWriter(new OutputStreamWriter(System.out));
		}else{
			bw = new BufferedWriter (new FileWriter(OUT_FILE) );
		}
		solution();
		bw.close();//Flushes too.
	}

	public static String nextToken() {
		while (st == null || !st.hasMoreElements()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
		return st.nextToken();
	}

	public static String nextLine() {
		st = null;
		try {
			return br.readLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return null;
	}

	public static int nextInt() {
		return Integer.parseInt(nextToken());
	}

	public static long nextLong() {
		return Long.parseLong(nextToken());
	}

	public static double nextDouble() {
		return Double.parseDouble(nextToken());
	}
	
	public static void println(Object s) throws IOException{
		bw.write(s.toString()+"\n");
	}
	
	public static void println() throws IOException{
		bw.newLine();
	}

    public static void print(Object s) throws IOException{
		bw.write(s.toString());
	}
	public static void flush() throws IOException{//Useful for debug
		bw.flush();
	}
	//Other
	public static class Arr<T> extends ArrayList<T> {} //I hate typing ArrayList
}