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;
int n, m, arr[200005], sz, fq[1000005];
pair<pair<int, int>, int> q[200005];
long long sq[200005], ans[200005], ca;
bool cmp(pair<pair<int, int>, int> x, pair<pair<int, int>, int> y) {
  int nx = x.first.first / sz;
  int ny = y.first.first / sz;
  if (nx != ny) return ny > nx;
  return y.first.second > x.first.second;
}
int add(int x) {
  ca -= (sq[fq[x]] * x);
  fq[x]++;
  ca += (sq[fq[x]] * x);
}
int rem(int x) {
  ca -= (sq[fq[x]] * x);
  fq[x]--;
  ca += (sq[fq[x]] * x);
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  for (long long i = 0; i <= 200000; i++) sq[i] = i * i;
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &q[i].first.first, &q[i].first.second);
    q[i].first.first--;
    q[i].first.second--;
    q[i].second = i;
  }
  sz = sqrt(n);
  sort(q, q + m, cmp);
  int ml = 0, mr = -1;
  for (int i = 0; i < m; i++) {
    int l = q[i].first.first;
    int r = q[i].first.second;
    while (mr < r) {
      mr++;
      add(arr[mr]);
    }
    while (mr > r) {
      rem(arr[mr]);
      mr--;
    }
    while (ml < l) {
      rem(arr[ml]);
      ml++;
    }
    while (ml > l) {
      ml--;
      add(arr[ml]);
    }
    ans[q[i].second] = ca;
  }
  for (int i = 0; i < m; i++) printf("%I64d\n", ans[i]);
}
