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.*;
import java.util.*;
public final class powerful_mo
{
    static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	static FastScanner sc=new FastScanner(br);
    static PrintWriter out=new PrintWriter(System.out);
	static long ans=0;
	static long[] res;
	static int maxn=(int)(1e6)+3,n,q,block;
	static Node[] arr;
	static int[] a,cnt;

	static void add(int curr)
	{
		long curr_val=cnt[curr];ans+=(curr*((2L*curr_val)+1));cnt[curr]++;
	}
	
	static void remove(int curr)
	{
		long curr_val=cnt[curr]-1;ans-=(curr*((2L*curr_val)+1L));cnt[curr]--;
	}
	
    public static void main(String args[]) throws Exception
    {
		n=sc.nextInt();q=sc.nextInt();block=(int)Math.sqrt(n);a=new int[n+1];arr=new Node[q];res=new long[q];cnt=new int[maxn];
		for(int i=1;i<=n;i++)
		{
			a[i]=sc.nextInt();
		}
		for(int i=0;i<q;i++)
		{
			arr[i]=new Node(i,sc.nextInt(),sc.nextInt());
		}
		Arrays.sort(arr,new Comparator<Node>()
		{
			public int compare(Node x1,Node x2)
			{
				if(x1.l/block==x2.l/block)
				{
					return x1.r-x2.r;
				}
				return (x1.l/block)-(x2.l/block);
			}
		});
		int l=1,r=1;
		for(int i=0;i<q;i++)
		{
			while(l<arr[i].l)
			{
				remove(a[l]);l++;
			}
			while(l>arr[i].l)
			{
				add(a[l-1]);l--;
			}
			while(r<=arr[i].r)
			{
				add(a[r]);r++;
			}
			while(r>arr[i].r+1)
			{
				remove(a[r-1]);r--;
			}
			res[arr[i].idx]=ans;
		}
		for(int i=0;i<q;i++)
		{
			out.println(res[i]);
		}
		out.close();
    }
}
class Node
{
	int idx,l,r;
	public Node(int idx,int l,int r)
	{
		this.idx=idx;this.l=l;this.r=r;
	}
}
class FastScanner
{
    BufferedReader in;
    StringTokenizer st;

    public FastScanner(BufferedReader in) {
        this.in = in;
    }
	
    public String nextToken() throws Exception {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken();
    }
	
	public String next() throws Exception {
		return nextToken().toString();
	}
	
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }

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

    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}