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

/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
*/
import java.util.*;
import java.io.*;

   public class x86D
   {
      public static void main(String omkar[]) throws Exception
      {
         //BufferedReader infile = new BufferedReader(new FileReader("cowdate.in"));
         BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));  
         StringTokenizer st = new StringTokenizer(infile.readLine());
         int N = Integer.parseInt(st.nextToken());
         int T = Integer.parseInt(st.nextToken());
         int[] arr = new int[N];
         st = new StringTokenizer(infile.readLine());
         for(int i=0; i < N; i++)
            arr[i] = Integer.parseInt(st.nextToken());
         StringBuilder sb = new StringBuilder();
         int[] map = new int[1000005];
         ArrayList<Query> ls = new ArrayList<Query>();
         for(int qw=0; qw < T; qw++)
         {
            st = new StringTokenizer(infile.readLine());
            int l = Integer.parseInt(st.nextToken())-1;
            int r = Integer.parseInt(st.nextToken())-1;
            ls.add(new Query(l, r, qw));
         }
         Collections.sort(ls);
         long[] rest = new long[T];
         long res = 0L;
         int left = -1;
         int right = -1;
         for(Query q: ls)
         {
            if(res == 0L)
            {
               //first
               left = q.left;
               right = q.right;
               for(int i=left; i <= right; i++)
               {
                  int val = arr[i];
                  res -= (long)map[val]*map[val]*arr[i];
                  map[val]++;
                  res += (long)map[val]*map[val]*arr[i];
               }
               rest[q.i] = res;
               continue;
            }
            while(left > q.left)
            {
               left--;
               int val = arr[left];
               res -= (long)map[val]*map[val]*arr[left];
               map[val]++;
               res += (long)map[val]*map[val]*arr[left];
            }
            while(left < q.left)
            {
               int val = arr[left];
               res -= (long)map[val]*map[val]*arr[left];
               map[val]--;
               res += (long)map[val]*map[val]*arr[left];
               left++;
            }
            while(right < q.right)
            {
               right++;
               int val = arr[right];
               res -= (long)map[val]*map[val]*arr[right];
               map[val]++;
               res += (long)map[val]*map[val]*arr[right];
            }
            while(right > q.right)
            {
               int val = arr[right];
               res -= (long)map[val]*map[val]*arr[right];
               map[val]--;
               res += (long)map[val]*map[val]*arr[right];
               right--;
            }
            rest[q.i] = res;
         }
         for(long x: rest)
            sb.append(x).append("\n");
         System.out.print(sb);
      }
   }
   class Query implements Comparable<Query>
   {
      public int SQRT = 400;
      public int left;
      public int right;
      public int i;
      
      public Query(int a, int b, int c)
      {
         left = a;
         right = b;
         i = c;
      }
      public int compareTo(Query oth)
      {
         int x = left/SQRT;
         int y = oth.left/SQRT;
         if(x == y)
            return right-oth.right;
         return x-y;
      }
   }