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.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.Arrays;
import java.util.StringTokenizer;

// Yandex.Algorithm 2001 Round 2
// Powerful array
public class Problem_86_D {
    

    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        PrintWriter out = new PrintWriter(outputStream);
        Problem_86_D solver = new Problem_86_D();
        solver.solve(1, new InputStreamReader(inputStream), out);
        out.close();
    }
    
    static final class Mo {
      long current_answer;
      final int[] cnt = new int[1_000_001];

      final long diff(int number)
      {
         return ((long)number) * (2 * cnt[number] + 1);
      }

      Mo()
      {
        current_answer = 0;
      }

      void add(int number)
      {
        current_answer += diff(number);
        cnt[number]++;
      }

      void remove(int number)
      {
        cnt[number]--;
        current_answer -= diff(number);
      }

      long[] solve(int n, Query[] queries, int[] a)
      {
        BLOCK_SIZE = (int)Math.sqrt(n);
        Arrays.sort(queries);
        
        long[] res = new long[queries.length];
        
        int currentL = 0;
        int currentR = 0;
        for(Query q : queries) {
          int l = q.left;
          int r = q.right;
          while(currentL < l) {
            remove(a[currentL++]);
          }
          while(currentL > l) {
            add(a[--currentL]);
          }
          while(currentR <= r) {
            add(a[currentR++]);
          }
          while(currentR > r + 1) {
            remove(a[--currentR]);
          }
          res[q.index] = current_answer;
        }
        return res;
      }

    }
    
    static int BLOCK_SIZE = 1;

    static class Query implements Comparable<Query> {
      int index;
      int left;
      int right;
      
      Query(int i, int l, int r)
      {
        index = i;
        left = l;
        right = r;
      }
      
      @Override
      public int compareTo(Query o)
      {
        int r = Integer.compare(left / BLOCK_SIZE, o.left / BLOCK_SIZE);
        if(r == 0)
          r = Integer.compare(right, o.right);
        return r;
      }
    }

    public void solve(int test, Reader input, PrintWriter out)
    {
        MyScanner in = new MyScanner(input);
        
        int n = in.nextInt();
        int t = in.nextInt();
        
        int[] a = in.nextIntArray(n);
        
        Mo mo = new Mo();
        
        Query[] queries = new Query[t];
        for(int i = 0; i < t; i++)
          queries[i] = new Query(i, in.nextInt()-1, in.nextInt()-1);
        
        long[] res = mo.solve(n, queries, a);
        
        for(long l : res)
          out.println(l);
    }

    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner(Reader reader) {
            br = new BufferedReader(reader);
        }

        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());
        }

        int[] nextIntArray(int n)
        {
            int[] r = new int[n];
            for(int i = 0; i < n; i++)
                r[i] = nextInt();
            return r;
        }

        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;
        }

    }
    //--------------------------------------------------------

}
