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;
struct item {
  int l, r, i;
};
const int mxn = 2e5 + 10, MX_N = 1e6 + 5, md = 998244353;
long long T, n, k, q, answer;
long long ans[mxn];
int cnt[MX_N][2];
vector<item> Q;
vector<int> g, v;
bool mark[MX_N];
bool comp(item a, item b) {
  if (a.l / q < b.l / q) {
    return true;
  }
  if (a.l / q > b.l / q) {
    return false;
  }
  if (a.r / q < b.r / q) {
    return true;
  }
  return false;
}
void input() {
  cin >> n >> T;
  int l, r;
  for (int i = 0; i < n; i++) {
    cin >> k;
    g.push_back(k);
  }
  for (int i = 0; i < T; i++) {
    cin >> l >> r;
    --l;
    Q.push_back({l, r, i});
  }
}
void solve() {
  answer = 0, q = ceil(sqrt(n));
  sort(Q.begin(), Q.end(), comp);
  int x = 0, y = 0;
  for (int i = 0; i < Q.size(); i++) {
    int l = Q[i].l;
    int r = Q[i].r;
    while (x < l) {
      cnt[g[x]][1]--;
      v.push_back(g[x]);
      mark[g[x]] = 1;
      x++;
    }
    while (x > l) {
      x--;
      v.push_back(g[x]);
      mark[g[x]] = 1;
      cnt[g[x]][1]++;
    }
    while (y < r) {
      cnt[g[y]][1]++;
      v.push_back(g[y]);
      mark[g[y]] = 1;
      y++;
    }
    while (y > r) {
      y--;
      v.push_back(g[y]);
      mark[g[y]] = 1;
      cnt[g[y]][1]--;
    }
    for (int j = 0; j < v.size(); j++) {
      if (mark[v[j]] == 1) {
        mark[v[j]] = 0;
        answer -= (1LL * cnt[v[j]][0] * cnt[v[j]][0] * v[j]);
        cnt[v[j]][0] += cnt[v[j]][1];
        cnt[v[j]][1] = 0;
        answer += (1LL * cnt[v[j]][0] * cnt[v[j]][0] * v[j]);
      }
    }
    v.clear();
    ans[Q[i].i] = answer;
  }
  for (int i = 0; i < T; i++) {
    cout << ans[i] << " ";
  }
}
int main() {
  ios::sync_with_stdio(false);
  input(), solve();
  return 0;
}
