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

/*
 *created by Kraken on 08-05-2020 at 10:06
 */
//package com.kraken.cf.practice;

import java.util.*;
import java.io.*;

public class D86 {
  private static int BLOCK_SIZE;
  private static int ml, mr;
  private static long ans;
//  private static Map<Long, Integer> map = new HashMap<>();
  private static int[] count;
  private static Query[] queries;
  private static long[] res;

  private static class Query {
    int l, r, idx;

    public Query(int l, int r, int idx) {
      this.l = l;
      this.r = r;
      this.idx = idx;
    }

    @Override
    public String toString() {
      return "Query{" +
        "l=" + l +
        ", r=" + r +
        ", idx=" + idx +
        '}';
    }
  }

  private static void add(int x) {
    long cnt = count[x];
    ans -= cnt * cnt * x;
    cnt++;
    count[x] = (int) cnt;
    ans += cnt * cnt * x;
  }

  private static void remove(int x) {
    long cnt = count[x];
    ans -= cnt * cnt * x;
    if (cnt > 0) cnt--;
    count[x] = (int) cnt;
    ans += cnt * cnt * x;
  }

  public static void main(String[] args) {
    FastReader sc = new FastReader();
    int n = sc.nextInt(), m = sc.nextInt();
    ml = 0; mr = -1;
    BLOCK_SIZE = (int) Math.sqrt(n);
    int[] x = new int[n];
    queries = new Query[m];
    res = new long[m];
    count = new int[1000001];
    for (int i = 0; i < n; i++) {
      x[i] = sc.nextInt();
    }
    for (int i = 0; i < m; i++) {
      int l = sc.nextInt() - 1;
      int r = sc.nextInt() - 1;
      queries[i] = new Query(l, r, i);
    }
    Arrays.sort(queries, (o1, o2) -> {
      if (o1.l / BLOCK_SIZE == o2.l / BLOCK_SIZE) return o1.r - o2.r;
      else return o1.l / BLOCK_SIZE - o2.l / BLOCK_SIZE;
    });
    for (Query q : queries) {
      while (mr > q.r) {
        remove(x[mr]);
        mr--;
      }
      while (mr < q.r) {
        mr++;
        add(x[mr]);
      }
      while (ml < q.l) {
        remove(x[ml]);
        ml++;
      }
      while (ml > q.l) {
        ml--;
        add(x[ml]);
      }
      res[q.idx] = ans;
    }
    StringBuilder sb = new StringBuilder();
    for (long i : res) sb.append(i + "\n");
    System.out.print(sb.toString());
  }

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