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 query {
  long long l;
  long long r;
  long long i;
};
query Q[200001];
long long ar[200001];
long long ans[200001];
long long freq[1000001];
long long power = 0;
bool comp(query a, query b) {
  if (a.l / 555 != b.l / 555) return a.l / 555 < b.l / 555;
  return a.r < b.r;
}
void add(long long pos) {
  long long ele = ar[pos];
  long long cur = freq[ele];
  freq[ele]++;
  long long curF = freq[ele];
  power -= (cur * cur * ele);
  power += (curF * curF * ele);
}
void remove(long long pos) {
  long long ele = ar[pos];
  long long cur = freq[ele];
  freq[ele]--;
  long long curF = freq[ele];
  power -= (cur * cur * ele);
  power += (curF * curF * ele);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, q;
  cin >> n >> q;
  for (long long i = 0; i < n; i++) cin >> ar[i];
  for (long long i = 0; i < q; i++) {
    cin >> Q[i].l >> Q[i].r;
    Q[i].i = i, Q[i].l--, Q[i].r--;
  }
  sort(Q, Q + q, comp);
  long long ML = 0, MR = -1;
  for (int i = 0; i < q; i++) {
    long long L = Q[i].l;
    long long R = Q[i].r;
    int idx = Q[i].i;
    while (ML > L) ML--, add(ML);
    while (MR < R) MR++, add(MR);
    while (ML < L) remove(ML), ML++;
    while (MR > R) remove(MR), MR--;
    ans[idx] = power;
  }
  for (long long i = 0; i < q; i++) cout << ans[i] << '\n';
}
