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 Yandex2011_2D {
public static void main(String[] args) throws IOException
{
	input.init(System.in);
	PrintWriter out = new PrintWriter(System.out);
	int n = input.nextInt(), m = input.nextInt();
	sqrt = (int)Math.sqrt(n);
	int[] data = new int[n];
	for(int i = 0; i<n; i++) data[i] = input.nextInt();
	Query[] qs = new Query[m];
	for(int i = 0; i<m; i++) qs[i] = new Query(input.nextInt()-1, input.nextInt()-1, i);
	long[] output = new long[m];
	Arrays.sort(qs);
	fs = new long[1000001];
	res = 0;
	int left = 0, right = -1;
	for(int i = 0; i<m; i++)
	{
		int a = qs[i].a, b = qs[i].b;
		while(left < a)
		{
			remove(data[left]);
			left++;
		}
		while(left > a)
		{
			left--;
			add(data[left]);
		}
		while(right < b)
		{
			right++;
			add(data[right]);
		}
		while(right > b)
		{
			remove(data[right]);
			right--;
		}
		output[qs[i].i] = res;
	}
	for(long x : output) out.println(x);
	out.close();
}
static long[] fs;
static long res;
static int sqrt;
static void remove(int x)
{
	res -= x * (fs[x] + fs[x] - 1);
	fs[x]--;
}
static void add(int x)
{
	res += x * (fs[x] + fs[x] + 1);
	fs[x]++;
}
static class Query implements Comparable<Query>
{
	int a, b, block, i;
	public Query(int aa, int bb, int ii)
	{
		a = aa; b = bb; block = a / sqrt; i = ii;
	}
	@Override
	public int compareTo(Query o) {
		// TODO Auto-generated method stub
		if(block != o.block) return block - o.block;
		return b - o.b;
	}
}
public static class input {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                     new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    /** get next word */
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                   reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }
	
    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
}
}
