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

public class Main
{
    static int size;
    static int[]a;
    static Item[]item;

    static long ans[]=new long[200002];
    static int cnt[]=new int[1000002];
    static long power=0;

	static class Item implements Comparable<Item>{
        int l, r, i;
        public Item(int i, int l, int r){
            this.l = l;
            this.r = r;
            this.i = i;
        }
        public int compareTo(Item k){
            if(l / size == k.l / size) return r - k.r;
            else return l - k.l;
        }
    }
    
    public static void add(int a)
    {
        power += (long)a * (cnt[a] + cnt[a] + 1);
        cnt[a]++;
    }
    
    public static void remove(int a)
    {
        power -= (long)a * (cnt[a] + cnt[a] - 1);
        cnt[a]--;
    }
    
    public static void solution(int m)
    {
        
        int cur_l=0,cur_r=-1;
        int l=0,r=-1;
        int pow=0;
        
        for(int i=0;i<m;i++)
        {
            l=item[i].l;
            r=item[i].r;
            while(cur_r<r) 
            {
                cur_r++;
                add(a[cur_r]);
            }
            while(cur_l<l) 
            {
                remove(a[cur_l]);
                cur_l++;
            }
            while(cur_l>l) 
            {
                cur_l--;
                add(a[cur_l]);
            }
            while(cur_r>r) 
            {
                remove(a[cur_r]);
                cur_r--;
            }
           
            ans[item[i].i] = power;
        }
        
    }
	public static void main(String[] args)throws IOException
	{
	   BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	   PrintWriter out = new PrintWriter(System.out);
	   String[]s=br.readLine().split(" ");
	   int n=Integer.parseInt(s[0]);
	   int m=Integer.parseInt(s[1]);
	   
	   size=(int)Math.sqrt(n);
	   a=new int[n];
	   s=br.readLine().split(" ");
	   for(int i=0;i<n;i++)
	   {
	       a[i]=Integer.parseInt(s[i]);
	   }
	   item=new Item[m];
	   for(int i=0;i<m;i++)
	   {
	       s=br.readLine().split(" ");
	       int l=Integer.parseInt(s[0]);
	       int r=Integer.parseInt(s[1]);
	       l--;r--;
	       item[i]=new Item(i,l,r);
	   }
	   Arrays.sort(item);
	
	   solution(m);
	   for(int i=0;i<m;i++)
	       out.println(ans[i]);
        out.close();
	}
}
