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

#include <bits/stdc++.h>
struct query {
  size_t l, r, index;
};
int input[200005];
query Q[200005];
int counter[1000006];
int64_t res[200005];
int main() {
  std::ios_base::sync_with_stdio(false);
  size_t n, m, l, r, bucket_size;
  int current_l = 0, current_r = 0;
  int64_t tmp_result = 0;
  std::cin >> n >> m;
  bucket_size = 1000;
  for (size_t i = 1; i <= n; ++i) std::cin >> input[i];
  for (size_t i = 0; i < m; ++i) {
    std::cin >> l >> r;
    Q[i] = (query{l, r, i});
  }
  std::sort(Q, Q + m, [&](query const& a, query const& b) -> bool {
    int bucketed_al = a.l / bucket_size;
    int bucketed_bl = b.l / bucket_size;
    if (bucketed_al != bucketed_bl) return bucketed_al < bucketed_bl;
    return (a.r < b.r) ^ ((bucketed_al) % 2);
  });
  int64_t el = 0;
  for (size_t i = 0; i < m; ++i) {
    l = Q[i].l;
    r = Q[i].r;
    while (current_l > l) {
      current_l--;
      el = input[current_l];
      tmp_result += ((counter[el]++ << 1) + 1) * el;
    }
    while (current_r < r) {
      current_r++;
      el = input[current_r];
      tmp_result += ((counter[el]++ << 1) + 1) * el;
    }
    while (current_l < l) {
      el = input[current_l];
      tmp_result -= ((--counter[el] << 1) + 1) * el;
      current_l++;
    }
    while (current_r > r) {
      el = input[current_r];
      tmp_result -= ((--counter[el] << 1) + 1) * el;
      current_r--;
    }
    res[Q[i].index] = tmp_result;
  }
  for (int i = 0; i < m; ++i) std::cout << res[i] << std::endl;
  return 0;
}
