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


public class A {
	
	static int a[], count[];
	static long ans, res[];
		
	static void add(int val)
	{
		ans += 1L * (val) * (((count[val]++)<<1) + 1);
	}
	
	static void remove(int val)
	{
		ans -= 1L * (val) * (((count[val]--)<<1) - 1);
	}
	
	public static void main(String[] args) throws IOException 
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);

		int n = sc.nextInt(), t = sc.nextInt();
		Query.s = (int) Math.sqrt(n);
		a = new int[n];
		for(int i = 0; i < n; ++i)
			a[i] = sc.nextInt();
		Query[] queries = new Query[t];
		for(int i = 0; i < t; ++i)
			queries[i] = new Query(sc.nextInt()-1, sc.nextInt()-1, i);
		Arrays.sort(queries);
		res = new long[t];
		count = new int[(int)1e6 + 1];
		add(a[0]);
		int currentL = 0, currentR = 0;
		for(Query q: queries)
		{
			while(currentL < q.l)
				remove(a[currentL++]);
			while(currentL > q.l)
				add(a[--currentL]);
			while(currentR > q.r)
				remove(a[currentR--]);
			while(currentR < q.r)
				add(a[++currentR]);
			res[q.idx] = ans;
		}
		for(int i = 0; i < t; ++i)
			out.println(res[i]);
		out.flush();
		out.close();
	}
	
	static class Query implements Comparable<Query>
	{
		static int s;
		int l, r, idx, block;
		
		Query(int x, int y, int z)
		{
			l = x;
			r = y;
			idx = z;
			block = l / s;
		}
		
		public int compareTo(Query q)
		{
			if(block != q.block)
				return block - q.block;
			return r - q.r;
		}
	}

}

class Scanner {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;
	public Scanner(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);
	}
}