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 MAX = 100000 + 5;
const int LEN = 50;
const long long MOD = 1000000007;
long long ans[200002], a[200002], BSize, cnt[1000003];
struct Qry {
  long long l, r, id;
} q[200002];
bool qcmp(Qry a, Qry b) {
  if (a.l / BSize == b.l / BSize) return a.r < b.r;
  return a.l / BSize < b.l / BSize;
}
int main() {
  long long n, i, j, t;
  cin >> n >> t;
  BSize = (long long)sqrt(n);
  for (i = 0; i < n; i++) cin >> a[i];
  int cn = 1;
  i = 0;
  for (i = 0; i < t; i++) {
    scanf("%lld %lld", &q[i].l, &q[i].r);
    q[i].l--, q[i].r--;
    q[i].id = i;
  }
  sort(q, q + t, qcmp);
  long long l = 0, r = 0, sum;
  cnt[a[0]]++, sum = a[0];
  for (i = 0; i < t; i++) {
    while (l < q[i].l)
      sum -= cnt[a[l]] * cnt[a[l]] * a[l], cnt[a[l]]--,
          sum += cnt[a[l]] * cnt[a[l]] * a[l], l++;
    while (l > q[i].l)
      l--, sum -= cnt[a[l]] * cnt[a[l]] * a[l], cnt[a[l]]++,
          sum += cnt[a[l]] * cnt[a[l]] * a[l];
    while (r < q[i].r)
      r++, sum -= cnt[a[r]] * cnt[a[r]] * a[r], cnt[a[r]]++,
          sum += cnt[a[r]] * cnt[a[r]] * a[r];
    while (r > q[i].r)
      sum -= cnt[a[r]] * cnt[a[r]] * a[r], cnt[a[r]]--,
          sum += cnt[a[r]] * cnt[a[r]] * a[r], r--;
    ans[q[i].id] = sum;
  }
  for (i = 0; i < t; i++) printf("%lld\n", ans[i]);
}
