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.lang.*;
import java.io.*;
 
public class Tester{
    
    static int mL =0;
    static int mR =-1;
    static long ans =0;
    static long [] fArr = new long [1000000];
    static int root =1;
    
    
    static class Query {
        
        public int l  ;
        public int r  ;
        public int index;    
    }
    
   
    
    static class myComp implements Comparator<Query>
    {
 
        public int compare(Query a ,Query b)
        {
            if(a.l/root!=b.l/root)
            {
                return  a.l/root- b.l/root;
            }
            else {
                return a.r-b.r;
            }
    }
    }
    
    
    public static void remove(int number)
    {
        long freq =fArr[number-1]--;
        ans = ans +((freq-1)*(freq-1)*number)-(freq*freq*number);
    }
    
    public static void add(int number)
    {
        long freq  =fArr[number-1]++;
        ans = ans +((freq+1)*(freq+1)*number)-(freq*freq*number);
    
    }
    public static long findAns(int l,int m,int[] mArr)
    {
        
    	 while(mR<m)
         {
         	 mR++;
             add(mArr[mR]);
            
         }
    	 
        while(mL<l)
        {
            remove(mArr[mL]);
            mL++;
        }
        while(mL>l)
        {
        	mL--;
            add(mArr[mL]);
            
        }
        
        while(mR>m)
        {
            remove(mArr[mR]);
            mR--;
        }
       
        
        
        return ans;
    }
    static class FastReader { BufferedReader br; StringTokenizer st; public FastReader() { br = new BufferedReader(new InputStreamReader(System.in)); } String next() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } }
    
    
    public static void main(String [] args)
    {
        
       FastReader in = new FastReader();
       PrintWriter out =new PrintWriter(System.out);
        
        int n = in.nextInt();
        int t= in.nextInt();
        
        int [] a =new int[n];
      
     
        for(int i =0;i<n;i++)
        {
        a[i] =in.nextInt();
        }
        
        root =555;
        Query [] q =new Query[t]; 
        for(int i =0;i<t;i++)
        {
        	q[i] =new Query();
        	q[i].l=in.nextInt()-1;
            q[i].r =in.nextInt()-1;
            q[i].index  =i;
        }
       
        Arrays.sort(q,new myComp());
        
        long [] ansArr =new long [t];
        
        for(int i=0;i<t;i++)
        {
            ansArr[q[i].index] =findAns(q[i].l,q[i].r,a);
        }
       
        
        for(int i =0;i<t;i++)
        {
        	out.println(ansArr[i]);
        }
        out.close();
        
    }
    
   
    
}