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.util.*;
import java.io.*;

public class c {
  public static int[] a;
  public static long[] result;
  public static int[] cnt = new int[1001000];

  public static class pair {
    public int fi, se, id;
    public pair (int a, int b, int id) {
      this.fi = a;
      this.se = b;
      this.id = id;
    }
  }

  public static pair[] qs;
  public static int L, R;
  public static long ans;

  public static void add (int pos) {
    ans += (long)(2 * cnt[a[pos]] + 1) * a[pos];
    cnt[a[pos]]++;
  }

  public static void rem (int pos) {
    ans -= (long)(2 * cnt[a[pos]] - 1) * a[pos];
    cnt[a[pos]]--;
  }



  public static void main (String[] args) {    
    FastReader in = new FastReader ();
    PrintWriter out = new PrintWriter (System.out);
    int n = in.nextInt(), m = in.nextInt(), K = (int)Math.sqrt(n) + 1;
    result = new long[m + 1];
    a = new int[n + 1];
    qs = new pair[m + 1];

    for (int i = 1; i <= n; i++)
      a[i] = in.nextInt();
    for (int i = 1; i <= m; i++) {
      qs[i] = new pair(in.nextInt(), in.nextInt(), i);
    }
    Arrays.sort(qs, (a, b) -> {
      if (a == null || b == null)
        return 0;
      if (a.fi / K != b.fi / K)
        return a.fi - b.fi;
      return a.se - b.se;
    });
    ans = 0;
    add(1); L = R = 1;
    for (int i = 1; i <= m; i++) {
      int l = qs[i].fi, r = qs[i].se;
      while (L > l)
        add (--L);
      while (R < r)
        add (++R);
      while (L < l)
        rem (L++);
      while (R > r)
        rem (R--);
      result[qs[i].id] = ans;
    }
    for (int i = 1; i <= m; i++)
      out.println (result[i]);
    out.close();
  }


  static class FastReader {
    BufferedReader br;
    StringTokenizer st;

    public FastReader() {
      br = new BufferedReader(new InputStreamReader(System.in));
    }

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

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