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, l, r, block, R, L, k, N, i, j, hooh, a[200001], Right[501],
    m1[1000001], c[1000001];
vector<pair<pair<int, int>, int> > t[501];
long long cnt, sum, ans[200001];
int in() {
  int xxxx;
  scanf("%d", &xxxx);
  return xxxx;
}
void process() {
  for (j = 1; j <= 1000000; ++j) c[j] = 0, m1[j] = 0;
}
int main() {
  cin >> n >> m;
  N = int(sqrt(n));
  for (i = 1; i <= n; ++i) {
    a[i] = in();
  }
  for (i = 1; i <= n; ++i) Right[(i - 1) / N + 1] = i;
  for (i = 1; i <= m; ++i) {
    l = in();
    r = in();
    block = (l - 1) / N + 1;
    t[block].push_back(make_pair(make_pair(r, l), i));
  }
  for (i = 1; i <= 500; ++i) {
    if (t[i].size() > 0) {
      process();
      R = Right[i];
      L = Right[i] + 1;
      sum = 0;
      sort(t[i].begin(), t[i].end());
      for (j = 0; j < t[i].size(); ++j) {
        l = t[i][j].first.second;
        r = t[i][j].first.first;
        cnt = sum;
        if (r < L) {
          for (k = l; k <= r; ++k) {
            cnt -= c[a[k]] * 1ll * c[a[k]] * 1ll * a[k] * 1ll;
            c[a[k]]++;
            cnt += c[a[k]] * 1ll * c[a[k]] * 1ll * a[k] * 1ll;
          }
          for (k = l; k <= r; ++k) c[a[k]] = 0;
        } else {
          while (R < r) {
            ++R;
            sum -= (m1[a[R]] * 1ll * m1[a[R]] * 1ll * a[R] * 1ll);
            m1[a[R]]++;
            sum += (m1[a[R]] * 1ll * m1[a[R]] * 1ll * a[R] * 1ll);
          }
          cnt = sum;
          for (hooh = L - 1; hooh >= l; --hooh) {
            cnt -= (m1[a[hooh]] * 1ll * m1[a[hooh]] * 1ll * a[hooh] * 1ll);
            m1[a[hooh]]++;
            cnt += (m1[a[hooh]] * 1ll * m1[a[hooh]] * 1ll * a[hooh]) * 1ll;
          }
          for (hooh = L - 1; hooh >= l; --hooh) {
            m1[a[hooh]]--;
          }
        }
        ans[t[i][j].second] = cnt;
      }
    }
  }
  for (i = 1; i <= m; ++i) cout << ans[i] << endl;
  return 0;
}
