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;
inline int64_t gilbertOrder(int x, int y, int pow, int rotate) {
  if (pow == 0) return 0;
  int hpow = 1 << (pow - 1);
  int seg = (x < hpow) ? ((y < hpow) ? 0 : 3) : ((y < hpow) ? 1 : 2);
  seg = (seg + rotate) & 3;
  const int rotateDelta[4] = {3, 0, 0, 1};
  int nx = x & (x ^ hpow), ny = y & (y ^ hpow);
  int nrot = (rotate + rotateDelta[seg]) & 3;
  int64_t subSquareSize = int64_t(1) << (2 * pow - 2);
  int64_t ans = seg * subSquareSize;
  int64_t add = gilbertOrder(nx, ny, pow - 1, nrot);
  ans += (seg == 1 || seg == 2) ? add : (subSquareSize - add - 1);
  return ans;
}
struct Query {
  int l, r, idx;
  int64_t ord;
  inline void calcOrder() { ord = gilbertOrder(l, r, 19, 0); }
};
long long curr;
vector<int> v;
int cnt[1000010];
int walkRLeft(int r) {
  long long x = 2 * (cnt[v[r]]--) - 1;
  curr -= x * v[r];
  return r - 1;
}
int walkRRight(int r) {
  long long x = 2 * (cnt[v[++r]]++) + 1;
  curr += x * v[r];
  return r;
}
int walkLLeft(int l) {
  long long x = 2 * (cnt[v[--l]]++) + 1;
  curr += x * v[l];
  return l;
}
int walkLRight(int l) {
  long long x = 2 * (cnt[v[l]]--) - 1;
  curr -= x * v[l];
  return l + 1;
}
int main() {
  iostream::sync_with_stdio(false);
  cin.tie(NULL);
  int n, q;
  cin >> n >> q;
  v = vector<int>(n);
  for (auto &x : v) cin >> x;
  vector<Query> qs(q);
  for (int i = 0; i < q; ++i) {
    cin >> qs[i].l >> qs[i].r;
    qs[i].idx = i;
    qs[i].calcOrder();
  }
  sort(qs.begin(), qs.end(), [&](Query &a, Query &b) { return a.ord < b.ord; });
  vector<long long> ans(q);
  int lastL = 0, lastR = 0;
  curr = v[0];
  cnt[v[0]]++;
  for (auto q : qs) {
    q.l--;
    q.r--;
    while (lastR < q.r) lastR = walkRRight(lastR);
    while (lastL > q.l) lastL = walkLLeft(lastL);
    while (lastR > q.r) lastR = walkRLeft(lastR);
    while (lastL < q.l) lastL = walkLRight(lastL);
    ans[q.idx] = curr;
  }
  for (auto x : ans) cout << x << "\n";
}
