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 long long MOD = (long long)1e9 + 7;
const int inf = (int)1e9 + 7;
const double eps = 1e-7;
const double pi = 3.14159265359;
const int N = (int)2e5;
const int A = 1e6;
const int T = 447;
struct Q {
  int t;
  int l, r;
};
int n, t, a[N], block_ind[N];
long long ans, res[N], cnt[A + 1];
Q query[N];
bool cmp(Q a, Q b) {
  if (block_ind[a.l] == block_ind[b.l]) {
    return a.r < b.r;
  }
  return block_ind[a.l] < block_ind[b.l];
}
void push(int ind) {
  ans -= cnt[a[ind]] * cnt[a[ind]] * a[ind];
  ++cnt[a[ind]];
  ans += cnt[a[ind]] * cnt[a[ind]] * a[ind];
}
void pop(int ind) {
  ans -= cnt[a[ind]] * cnt[a[ind]] * a[ind];
  --cnt[a[ind]];
  ans += cnt[a[ind]] * cnt[a[ind]] * a[ind];
}
int main() {
  scanf("%d%d", &n, &t);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  for (int i = 0; i < n; ++i) block_ind[i] = i / T;
  for (int i = 0; i < t; ++i) {
    int l, r;
    scanf("%d%d", &l, &r);
    --l;
    --r;
    query[i].t = i;
    query[i].l = l;
    query[i].r = r;
  }
  sort(query, query + t, cmp);
  int l = 0, r = 0;
  ++cnt[a[0]];
  ans = a[0];
  for (int i = 0; i < t; ++i) {
    while (l > query[i].l) {
      --l;
      push(l);
    }
    while (r < query[i].r) {
      ++r;
      push(r);
    }
    while (l < query[i].l) {
      pop(l);
      ++l;
    }
    while (r > query[i].r) {
      pop(r);
      --r;
    }
    res[query[i].t] = ans;
  }
  for (int i = 0; i < t; ++i) printf("%lld\n", res[i]);
  return 0;
}
