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;
int ara[200100], sq, F[1000100];
long long int val, out[200100];
struct query {
  int l, r, index;
  bool operator<(const query& p) const {
    if ((l / sq) == (p.l / sq)) return (r / sq) < (p.r / sq);
    return (l / sq) < (p.l / sq);
  }
};
query Q[200100];
inline void Add(int pos) {
  val += (long long int)((F[ara[pos]] << 1) + 1) * (long long int)ara[pos];
  F[ara[pos]]++;
}
inline void Remove(int pos) {
  val -= (long long int)((F[ara[pos]] << 1) - 1) * (long long int)ara[pos];
  F[ara[pos]]--;
}
int main() {
  int i, n, q, x, y;
  while (scanf("%d %d", &n, &q) == 2) {
    memset(F, 0, sizeof(F));
    sq = (int)sqrt(n);
    for (i = 1; i <= n; i++) scanf("%d", &ara[i]);
    for (i = 1; i <= q; i++) {
      scanf("%d %d", &x, &y);
      Q[i].l = x;
      Q[i].r = y;
      Q[i].index = i;
    }
    sort(Q + 1, Q + q + 1);
    int lp = 1, rp = 0;
    val = 0;
    for (i = 1; i <= q; i++) {
      while (lp < Q[i].l) {
        Remove(lp);
        lp++;
      }
      while (lp > Q[i].l) {
        lp--;
        Add(lp);
      }
      while (rp < Q[i].r) {
        rp++;
        Add(rp);
      }
      while (rp > Q[i].r) {
        Remove(rp);
        rp--;
      }
      out[Q[i].index] = val;
    }
    for (i = 1; i <= q; i++) printf("%I64d\n", out[i]);
  }
  return 0;
}
