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;
long long n, m, k, ks, f[1000039], s[200039], q[200039], tot, pus, a[200039],
    l = 1, r = 0, ans[200039];
struct yyy {
  long long x, y, num;
} sf[200039];
inline bool cmp(yyy x, yyy y) {
  return (s[x.x] ^ s[y.x]) ? (x.x < y.x)
                           : ((s[x.x] & 1) ? x.y < y.y : x.y > y.y);
}
inline void read(long long &x) {
  char s = getchar();
  x = 0;
  while (s < '0' || s > '9') s = getchar();
  while (s >= '0' && s <= '9')
    x = (x << 3) + (x << 1) + (s ^ 48), s = getchar();
}
inline void print(register long long x) {
  if (x > 9) print(x / 10);
  putchar(x % 10 + 48);
}
int main() {
  register int i, j;
  scanf("%lld%lld", &n, &m);
  ks = sqrt(n);
  for (i = 1; i <= n; i++) read(a[i]);
  for (i = 1; i <= ks; i++) s[i] = 1;
  for (i = ks + 1; i <= n; i++) s[i] = s[i - ks] + 1;
  for (i = 1; i <= m; i++) {
    read(sf[i].x);
    read(sf[i].y);
    sf[i].num = i;
  }
  sort(sf + 1, sf + m + 1, cmp);
  for (i = 1; i <= m; i++) {
    while (sf[i].x < l) l--, tot += (f[a[l]] * 2 + 1) * a[l], f[a[l]]++;
    while (sf[i].x > l) tot -= (f[a[l]] * 2 - 1) * a[l], f[a[l]]--, l++;
    while (sf[i].y < r) tot -= (f[a[r]] * 2 - 1) * a[r], f[a[r]]--, r--;
    while (sf[i].y > r) r++, tot += (f[a[r]] * 2 + 1) * a[r], f[a[r]]++;
    ans[sf[i].num] = tot;
  }
  for (i = 1; i <= m; i++) print(ans[i]), putchar('\n');
}
