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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class DYandex2011r2 {
	static int BLOCK;
	static long sol;
	static int[] count,list;
	public static void main(String[] args) {
		InputReader scan = new InputReader(System.in);
		PrintWriter out = new PrintWriter(System.out);
		final int N = scan.nextInt(), Q = scan.nextInt();
		list = new int[N];
		for(int i=0;i<N;i++)list[i] = scan.nextInt();
		
		BLOCK = (int)Math.ceil(Math.sqrt(N));
		if(BLOCK>=300)BLOCK+=100;
		
		Query[] q = new Query[Q];
		for(int i=0;i<Q;i++)
			q[i] = new Query(scan.nextInt()-1,scan.nextInt()-1,i);
		
		Arrays.sort(q);
		
		sol = 0;
		count = new int[1000001];
		long[] fin = new long[Q];
		int idx = 0;
		int l = 0, r = -1;
		while(idx<Q){
			while(r<q[idx].r){
				r++;
				add(r);
			}
			while(l>q[idx].l){
				l--;
				add(l);
			}
			while(r>q[idx].r){
				sub(r);
				r--;
			}
			while(l<q[idx].l){
				sub(l);
				l++;
			}
			fin[q[idx].idx] = sol;
			idx++;
		}
		for(int i=0;i<Q;i++)out.println(fin[i]);
		out.close();
	}
	
	private static void add(int idx){
		
		int x = list[idx], c = count[(int)x];
		
		sol+=(long)x*((c<<1)+1);
		
		count[x]++;
	}
	
	private static void sub(int idx) {
		 
		int x = list[idx], c = count[(int)x];
		sol-=(long)x*((c<<1)-1);
		count[x]--;
				
	}
	private static class Query implements Comparable<Query>{
		int block,l,r,idx;
		public Query(int l, int r,int idx) {
			this.l = l;
			this.idx = idx;
			this.r = r;
			block = l/BLOCK;
		}
		public int compareTo(Query o) {
			if(this.block == o.block)return Integer.compare(this.r, o.r);
			return Integer.compare(this.block,o.block);
		}
	}
	static class InputReader {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private InputReader.SpaceCharFilter filter;

		public InputReader(InputStream stream) {
			this.stream = stream;
		}

		public int read() {
			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 = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return isWhitespace(c);
		}

		public static boolean isWhitespace(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
	private static class FS {
		BufferedReader br;
		StringTokenizer st;
		public FS(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}
		String next(){
			while(st==null||!st.hasMoreElements()){
				try{st = new StringTokenizer(br.readLine());}
				catch(IOException e){e.printStackTrace();}
			}
			return st.nextToken();
		}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());}
		double nextDouble() { return Double.parseDouble(next());}
	}
}
