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.util.*;
import java.io.*;

public class CF_PowerfulArray
{
	public static void main(String[] klein) throws IOException
	{
		final IntIO in = new IntIO(System.in);

		final int n = in.getInt(), t = in.getInt();
		final int[] v = new int[n];
		for(int i = 0; i<n; i++) v[i] = in.getInt();

		Query.sqr = (int)Math.sqrt(n);
		final Query[] q = new Query[t];
		for(int i = 0; i<t; i++) q[i] = new Query(in.getInt()-1, in.getInt()-1, i);
		Arrays.sort(q);

		final long[] ans = new long[t], cnt = new long[1_000_001];
		long sum = 0;
		for(int i = 0, l = q[0].l, r = l-1; i<t; i++)
		{
			final int a = q[i].l, b = q[i].r;
			while(r<b){ cnt[v[++r]]++; sum += (2*cnt[v[r]]-1)*v[r]; }
			while(l>a){ cnt[v[--l]]++; sum += (2*cnt[v[l]]-1)*v[l]; }
			while(r>b){ cnt[v[r]]--; sum -= (2*cnt[v[r]]+1)*v[r--]; }
			while(l<a){ cnt[v[l]]--; sum -= (2*cnt[v[l]]+1)*v[l++]; }
			ans[q[i].i] = sum;
		}

		final PrintWriter out = new PrintWriter(System.out);
		for(int i = 0; i<t; i++) out.println(ans[i]);
		out.flush();
	}

	private static class Query implements Comparable<Query>
	{
		static int sqr;
		final int l, r, i, g;
		Query(final int ll, final int rr, final int idx)
		{
			l = ll; r = rr; i = idx; g = l/sqr;
		}

		public int compareTo(Query q)
		{
			if(g != q.g) return g - q.g;
			return r - q.r;
		}
	}

	private static class IntIO extends BufferedInputStream
	{
		public IntIO(final InputStream in)
		{
			super(in);
		}

		public IntIO(final InputStream in, final int buf_size)
		{
			super(in,buf_size);
		}

		public int getInt() throws IOException
		{
			int chr = read(), sum = chr-'0';
			while((chr = read())>' ') sum = (sum<<3)+sum+sum + chr-'0';
			if(chr==13) skip(1); //Windows
			return sum;
		}

		public int getSInt() throws IOException
		{
			int chr = read(), sum = 0;
			boolean neg = chr=='-';
			if(!neg) sum = chr-'0';
			while((chr = read())>' ') sum = (sum<<3)+sum+sum + chr-'0';
			if(chr==13) skip(1); //Windows
			return neg ? -sum : sum;
		}
	}
}
