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;
const int MX = 1e6 + 1;
int N, M, k;
int arr[200005];
long long ans;
int curL, curR, sq;
long long rep[MX];
long long res[200005];
struct Q {
  int l, r, b_id, q_id;
  Q() {}
  Q(int _l, int rr, int q) {
    l = _l;
    r = rr;
    b_id = _l / sq;
    q_id = q;
  }
  bool operator<(const Q &a) const {
    if (b_id == a.b_id) return r < a.r;
    return b_id < a.b_id;
  }
};
Q qu[MX];
long long pW(long long x, long long p) {
  if (p == 0) return 1;
  if (p == 1) return x;
  long long ans = pW(x, p / 2);
  ans *= ans;
  if (p & 1) ans *= x;
  return ans;
}
long long pw[1000005];
void add(int j) {
  ans -= (long long)pw[rep[arr[j]]] * arr[j];
  rep[arr[j]]++;
  ans += (long long)pw[rep[arr[j]]] * arr[j];
}
void removE(int j) {
  ans -= (long long)pw[rep[arr[j]]] * arr[j];
  rep[arr[j]]--;
  ans += (long long)pw[rep[arr[j]]] * arr[j];
}
int main() {
  int q;
  for (int i = 1; i < 1000001; i++) pw[i] = (long long)pW((long long)i, 2LL);
  scanf("%d%d", &N, &q);
  sq = (int)sqrt(N);
  for (int i = 0; i < N; i++) {
    scanf("%d", &arr[i]);
  }
  for (int i = 0; i < q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    l--;
    r--;
    qu[i] = Q(l, r, i);
  }
  sort(qu, qu + q);
  curR = curL = qu[0].l;
  curR = qu[0].r;
  for (int j = qu[0].l; j <= qu[0].r; j++) add(j);
  for (int i = 0; i < q; i++) {
    while (curL < qu[i].l) removE(curL++);
    while (curL > qu[i].l) add(--curL);
    while (curR < qu[i].r) add(++curR);
    while (curR > qu[i].r) removE(curR--);
    res[qu[i].q_id] = ans;
  }
  for (int i = 0; i < q; i++) {
    cout << res[i] << "\n";
  }
  return 0;
}
