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.awt.*;
import java.awt.event.*;
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.text.*; 
import java.util.*;
import java.util.regex.*;
/*
	  br = new BufferedReader(new FileReader("input.txt"));
	  pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	  br = new BufferedReader(new InputStreamReader(System.in));
	  pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
 */


public class Main {
	private static BufferedReader br;
	private static StringTokenizer st;
	private static PrintWriter pw;

	static int BUCKET_SIZE = (int)Math.sqrt(200000);
	
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		//int qq = 1;
		int qq = Integer.MAX_VALUE;
		//int qq = readInt();
		for(int casenum = 1; casenum <= qq; casenum++) {
			int n = readInt();
			int k = readInt();
			BUCKET_SIZE = (int)Math.sqrt(n);
			int[] list = new int[n];
			for(int i = 0; i < n; i++) {
				list[i] = readInt();
			}
			Query[] queries = new Query[k];
			for(int i = 0; i < k; i++) {
				queries[i] = new Query(readInt()-1, readInt()-1, i);
			}
			Arrays.sort(queries);
			long[] ans = new long[k];
			int[] appear = new int[1000001];
			int left = -1;
			int right = -1;
			int lastBucket = -1;
			long curr = 0;
			for(Query currQ: queries) {
				if(currQ.bucket() != lastBucket) {
					Arrays.fill(appear, 0);
					curr = 0;
					for(int a = currQ.left; a <= currQ.right; a++) {
						curr -= appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
						appear[list[a]]++;
						curr += appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
					}
				}
				else {
					for(int a = currQ.left; a < left; a++) {
						curr -= appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
						appear[list[a]]++;
						curr += appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
					}
					for(int a = left; a < currQ.left; a++) {
						curr -= appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
						appear[list[a]]--;
						curr += appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
					}
					for(int a = right+1; a <= currQ.right; a++) {
						curr -= appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
						appear[list[a]]++;
						curr += appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
					}
					for(int a = currQ.right+1; a <= right; a++) {
						curr -= appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
						appear[list[a]]--;
						curr += appear[list[a]] * 1L * appear[list[a]] * 1L * list[a];
					}
				}
				lastBucket = currQ.bucket();
				left = currQ.left;
				right = currQ.right;
				ans[currQ.index] = curr;
			}
			for(long out: ans) {
				pw.println(out);
			}
		}
		exitImmediately();
	}

	static class Query implements Comparable<Query> {
		public int left, right, index;
		public Query(int a, int b, int c) {
			left = a;
			right = b;
			index = c;
		}
		public int bucket() {
			return left / BUCKET_SIZE;
		}
		public int compareTo(Query q) {
			if(bucket() != q.bucket()) return bucket() - q.bucket();
			return right - q.right;
		}
	}
	
	private static void exitImmediately() {
		pw.close();
		System.exit(0);
	}

	private static long readLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	private static double readDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	private static int readInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	private static String nextLine() throws IOException  {
		if(!br.ready()) {
			exitImmediately();
		}
		st = null;
		return br.readLine();
	}

	private static String nextToken() throws IOException  {
		while(st == null || !st.hasMoreTokens())  {
			if(!br.ready()) {
				exitImmediately();
			}
			st = new StringTokenizer(br.readLine().trim());
		}
		return st.nextToken();
	}
}