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.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.TreeSet;
import java.awt.Color;
import java.awt.Graphics;
import java.awt.Point;
import java.awt.datatransfer.ClipboardOwner;

public class Solution 
{
	public static void main(String[] args) {
		new Solution().solve();		
	}
	PrintWriter out;
	long mod=1000000007L ;
	int sqrt;
	long answer=0L;
	int[] count=new int[(int)1e6+1];
	int[] arr;
	public void solve()
	{
		out=new PrintWriter(System.out);
		int n=in.nextInt();
		int q=in.nextInt();
		arr=in.nextIntArray(n);
		sqrn=(int)Math.ceil(Math.sqrt(n));
		//segTree tree=new segTree(new int[n]);
		qq[] qqq=new qq[q];
		for(int i=0;i<q;i++)
		{
			int l=in.nextInt()-1;
			int r=in.nextInt()-1;
			qqq[i]=new qq(i,l,r);
		}
		Arrays.sort(qqq);
//		System.out.println(Arrays.toString(qqq));
		
		int[] prv=new int[(int)1e6+1];
		Arrays.fill(prv, -1);
		long[] ans=new long[q];	
		int currentL=0;
		int currentR=0;
		for(int i=0;i<qqq.length;i++)
		{
			int L=qqq[i].l;
			int R=qqq[i].r;
			while(currentL < L) {
				remove(currentL);
				currentL++;
			}
			while(currentL > L) {
				add(currentL-1);
				currentL--;
			}
			while(currentR <= R) {
				add(currentR);
				currentR++;
			}
			while(currentR > R+1) {
				remove(currentR-1);
				currentR--;
			}
			ans[qqq[i].idx] = answer;
		}
		for(int i=0;i<q;i++)
		{
			out.println(ans[i]);
		}
		out.close();
	}
	
	public void add(int x)
	{
		long c=count[arr[x]];
//		System.out.println("add "+x);
		count[arr[x]]++;	
		answer+=arr[x]*(2L*c+1L);
		//System.out.println(answer);
	}
	
	public void remove(int x)
	{
//		System.out.println("remove "+x);
		count[arr[x]]--;
		long c=count[arr[x]];
		answer-=arr[x]*(2L*c+1L);
//		System.out.println(answer);
	}

//		
//		long pow(long a,int n,long m)
//		{
//			if(n==1)
//				return a;
//			if(n==0)
//				return 1;
//			long ans=pow(a,n/2,m);
//			ans*=ans;
//			ans%=m;
//			if(n%2!=0)
//				ans*=a;
//			ans%=m;
//			return ans;
//		}
	long sqrn;
	class qq implements Comparable<qq>
	{
		int l,r;
		int idx;
		public qq(int idx,int l,int r)
		{
			this.l=l;
			this.idx=idx;
			this.r=r;
		}
		
		@Override
		public int compareTo(qq o) {
			// TODO Auto-generated method stub
			if(this.l/sqrn==o.l/sqrn)
			{
				return Integer.compare(this.r, o.r);
			}
			else
			{
				return Integer.compare(this.l,o.l);
			}		
		}
		
		public String toString()
		{
			return "{ "+this.idx+" "+this.l+" "+this.r+" }";
		}
		
	}
	

	class segTree
	{
	//	int N =(int) 1e5; // limit for array size
		int n;  // array size
		int[] sum=new int[2*(int)1e5];
	
		public segTree(int[] arr)
		{
			n=arr.length;
			sum=new int[3*n];
			for(int i=0;i<arr.length;i++)
			{
				sum[i+n]=arr[i];
			}
			build();
			//			for(int i=0;i<2*arr.length;i++)
			//			{
			//				System.out.print(max[i]+" ");
			//			}
			//			System.out.println();
			//			for(int i=0;i<2*arr.length;i++)
			//			{
			//				System.out.print(count[i]+" ");
			//			}
			//	System.out.println(Arrays.toString(max)+" "+Arrays.toString(count));
		}
		void build() {  // build the tree
			for (int i = n - 1; i > 0; --i)
			{
				if(sum[i<<1]!=sum[i<<1|1])
				{
					sum[i] =sum[i<<1] + sum[i<<1|1];

				}
				else
				{
					sum[i]=sum[i<<1];
				}
			}
		}

				void modify(int p, int value) {  // set value at position p
				  for (sum[p += n] = value; p > 1; p >>= 1) sum[p>>1] = sum[p] + sum[p^1];
				}

		int query(int l, int r) {  // sum on interval [l, r)
		//	System.out.println(Arrays.toString(sum)+" "+l+" "+ r);
			int max1=0;
			for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
				if ((l&1)!=0)
				{
					max1+=sum[l];
					l++;
				}
				if ((r&1)!=0)
				{
					--r;
					max1+=sum[r];
				}
			}
			return max1;
		}
	}


	
	public class UF {

		private int[] parent;  // parent[i] = parent of i
		private byte[] rank;   // rank[i] = rank of subtree rooted at i (never more than 31)
		private int count;   
		int[] seg;
		int max;
		// number of components
		public UF(int N) {
			if (N < 0) throw new IllegalArgumentException();
			count = N;
			parent = new int[N];
			rank = new byte[N];
			seg=new int[N];
			for (int i = 0; i < N; i++) {
				parent[i] = i;
				rank[i] = 0;
				seg[i]=1;
			}
			max=1;
		}

		public int find(int p) {
			if (p < 0 || p >= parent.length) throw new IndexOutOfBoundsException();
			while (p != parent[p]) {
				parent[p] = parent[parent[p]];    // path compression by halving
				p = parent[p];
			}
			return p;
		}
		public int count() {
			return count;
		}

		public boolean connected(int p, int q) {
			return find(p) == find(q);
		}

		public boolean union(int p, int q) {
		//	System.out.println("uf "+p+" "+q);
			int rootP = find(p);
			int rootQ = find(q);
			if (rootP == rootQ) return false;

			// make root of smaller rank point to root of larger rank
			if      (rank[rootP] < rank[rootQ])
			{
				parent[rootP] = rootQ;
				seg[rootQ]+=seg[rootP];
				max=Math.max(seg[rootQ],max);
			}
			else if (rank[rootP] > rank[rootQ])
			{
				parent[rootQ] = rootP;
				seg[rootP]+=seg[rootQ];
				max=Math.max(seg[rootP],max);
			}
			else {
				parent[rootQ] = rootP;
				rank[rootP]++;
				seg[rootP]+=seg[rootQ];
				max=Math.max(seg[rootP],max);
			}
			count--;
			return true;
		}

	}










	

	public static int gcd(long a, long b) {
		BigInteger b1 = BigInteger.valueOf(a);
		BigInteger b2 = BigInteger.valueOf(b);
		BigInteger gcd = b1.gcd(b2);
		return gcd.intValue();
	}



	FasterScanner in=new FasterScanner();

	public static class FasterScanner {
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = System.in.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}

		public String nextString() {
			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 long nextLong() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long 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 int nextInt() {
			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 int[] nextIntArray(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextInt();
			}
			return arr;
		}

		public long[] nextLongArray(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextLong();
			}
			return arr;
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
	}
} 
