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.*;
import static java.lang.Math.*;

public class powerfularray
{
	static int[] array;
	static int no_queries;
	static int arr_size;
	static query[] queries;
	static long [] answers;
	static int[] count;
	static long cur_ans;
	static int BLOCK_SIZE;
	public static void main(String[] args) throws IOException{
		InputReader ir=new InputReader(System.in);
		OutputWriter ow=new OutputWriter(System.out);
		arr_size=ir.readInt();
		BLOCK_SIZE=(int)sqrt(arr_size);
		no_queries=ir.readInt();
		answers=new long[no_queries];
		queries=new query[no_queries];
		array=new int[arr_size];
		for(int i=0;i<arr_size;++i)
			array[i]=ir.readInt();
		for(int i=0;i<no_queries;++i)
			queries[i]=new query(ir.readInt()-1,ir.readInt()-1,i);
		mosalgo();
		for (int i=0;i<no_queries;++i ) 
			ow.printLine(answers[i]);
		ow.flush();
		ow.close();
	}
	static class comparator implements Comparator<query>
	{
		public int compare(query q1,query q2){
			return (q1.l)/BLOCK_SIZE==(q2.l)/BLOCK_SIZE?(int )(q1.r-q2.r):(int )(q1.l-q2.l);}
	}
	static class query
	{
		int l;int r;int id;
		query(int l,int r,int id){this.l=l;this.r=r;this.id=id;}
	}
	static void add(int x){
	    cur_ans+= x*1L*(count[x]<< 1|1);
	    ++count[x];
	}
 static  void removeX(int x){
	cur_ans-= x *1L*((count[x] - 1)<< 1|1);
	--count[x];
}
	static void mosalgo()
	{
		Arrays.sort(queries,new comparator());
		int mosleft=0;
		int mosright=-1;
		count=new int[1_000_002];
		for(int i=0;i<queries.length;++i)
		{
			int left=queries[i].l;
			int right=queries[i].r;
			if(i == 0||left/BLOCK_SIZE != queries[i - 1].l/BLOCK_SIZE) { 
          Arrays.fill(count,0);
          cur_ans=0;
          for(int j = left; j <= right; j++) {
             add(array[j]);
                   }
             mosleft= left;mosright=right;
              answers[queries[i].id] = cur_ans;
          }
          else
          {
			while(mosright<right)
                add(array[++mosright]);
            while(mosright>right){
            	removeX(array[mosright]);
            	--mosright;
            }
            while(mosleft<left){
            	removeX(array[mosleft]);
            	++mosleft;
            }
            while(mosleft>left)
            	add(array[--mosleft]);

            answers[queries[i].id]=cur_ans;
        }
		}
	}
	  static  class InputReader {     
    	private InputStream stream;
    	private byte[] buf = new byte[1024];
    	private int curChar;
    	private int numChars;
    	private SpaceCharFilter filter;
     
    	public InputReader(InputStream stream) {
    		this.stream = stream;
    		}     
    	public int read() {
    		if (numChars == -1)
    		    throw new InputMismatchException();
    		if (curChar >= numChars) {
    			curChar = 0;
    		try {
    				numChars = stream.read(buf);
    			} catch (IOException e) {
    				throw new InputMismatchException();
    			}
    		if (numChars <= 0)
    			return -1;
    			}
    			return buf[curChar++];
    		}     
    	public int readInt() {
    	    int c = read();
    		while (isSpaceChar(c))
    				c = read();
    		int sgn = 1;
    		if (c == '-') {
    			sgn = -1;
    			c = read();
    	}
    			int res = 0;
    			do {
    				if (c < '0' || c > '9')
    					throw new InputMismatchException();
    				res *= 10;
    				res += c - '0';
    				c = read();
    			} while (!isSpaceChar(c));
    			return res * sgn;
    		}     
    		public String readString() {
    			int c = read();
    			while (isSpaceChar(c))
    				c = read();
    			StringBuilder res = new StringBuilder();
    			do {
    				res.appendCodePoint(c);
    				c = read();
    			} while (!isSpaceChar(c));
    			return res.toString();
    		}     
    		public boolean isSpaceChar(int c) {
    			if (filter != null)
    				return filter.isSpaceChar(c);
    			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    		}     
    		public String next() {
    			return readString();
    		}     
    		public interface SpaceCharFilter {
    			public boolean isSpaceChar(int ch);
    		}
    	}     
   static class OutputWriter {
    		private final PrintWriter writer;     
    		public OutputWriter(OutputStream outputStream) {
    			writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    		}    
    		public OutputWriter(Writer writer) {
    			this.writer = new PrintWriter(writer);
    		}     
    		public void print(Object...objects) {
    			for (int i = 0; i < objects.length; i++) {
    				if (i != 0)
    					writer.print(' ');
    				writer.print(objects[i]);
    			}
    		}     
    		public void printLine(Object...objects) {
    			print(objects);
    			writer.println();
    		}     
    		public void close() {
    			writer.close();
    		}     
    		public void flush() {
    			writer.flush();
    		}     
    		}     
   static class IOUtils {     
    		public static int[] readIntArray(InputReader in, int size) {
    			int[] array = new int[size];
    			for (int i = 0; i < size; i++)
    				array[i] = in.readInt();
    			return array;
    		}     
    		}
}