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>
using namespace std;
long long int ar[200000 + 11], ans[200000 + 11], fr[1000000 + 11],
    sqdif[200000 + 11];
struct data {
  int l, r, id;
  data() {}
  data(int _l, int _r, int i) { l = _l, r = _r, id = i; }
};
vector<data> block[511];
bool cmp(const data &a, const data &b) { return a.r < b.r; }
long long int sum;
inline void add(int cur) {
  fr[ar[cur]]++;
  sum += (ar[cur] * sqdif[fr[ar[cur]]]);
}
inline void _remove(int cur) {
  sum -= (ar[cur] * sqdif[fr[ar[cur]]]);
  fr[ar[cur]]--;
}
int main() {
  int n, q, l, r, i, j;
  sqdif[1] = 1LL;
  for (i = 2; i <= 200000; i++) sqdif[i] = (i * i) - (i - 1) * (i - 1);
  scanf("%d %d", &n, &q);
  for (i = 1; i <= n; i++) scanf("%I64d", &ar[i]);
  int bl = sqrt(n - 1) + 1;
  for (i = 0; i < q; i++) {
    scanf("%d %d", &l, &r);
    int b = ((l - 1) / bl) + 1;
    block[b].push_back(data(l, r, i));
  }
  for (i = 1; i <= bl; i++) sort(block[i].begin(), block[i].end(), cmp);
  int curl = 0, curr = 0;
  for (i = 1, sum = 0; i <= bl; i++) {
    for (j = 0; j < block[i].size(); j++) {
      l = block[i][j].l;
      r = block[i][j].r;
      while (curl > l) {
        curl--;
        add(curl);
      }
      while (curl < l) {
        _remove(curl);
        curl++;
      }
      while (curr > r) {
        _remove(curr);
        curr--;
      }
      while (curr < r) {
        curr++;
        add(curr);
      }
      ans[block[i][j].id] = sum;
    }
  }
  for (i = 0; i < q; i++) printf("%I64d\n", ans[i]);
  return 0;
}
