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 record {
  int ith;
  int l;
  int r;
};
long long sum = 0, ans[200005] = {0};
int num[1000005] = {0}, a[200005] = {0};
struct record query[200005] = {0, 0, 0};
int block;
bool cmp(struct record a, struct record b) {
  if (a.l / block == b.l / block) {
    if (a.r == b.r)
      return (a.l < b.l);
    else
      return (a.r < b.r);
  } else
    return a.l / block < b.l / block;
}
void add(int i) {
  num[a[i]]++;
  sum += (long long)a[i] * (2 * num[a[i]] - 1);
}
void delet(int i) {
  num[a[i]]--;
  sum -= (long long)a[i] * (2 * num[a[i]] + 1);
}
int main() {
  ios::sync_with_stdio(false);
  int n, i, j, k, t, m;
  cin >> n >> t;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 1; i <= t; i++) {
    query[i].ith = i;
    cin >> query[i].l >> query[i].r;
  }
  block = (int)sqrt((double)n);
  sort(query + 1, query + 1 + t, cmp);
  int lef = 1, rig = 0;
  for (i = 1; i <= t; i++) {
    while (lef < query[i].l) delet(lef++);
    while (lef > query[i].l) add(--lef);
    while (rig < query[i].r) add(++rig);
    while (rig > query[i].r) delet(rig--);
    ans[query[i].ith] = sum;
  }
  for (i = 1; i <= t; i++) cout << ans[i] << endl;
  return 0;
}
