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;
static const int MAXN = 1e6 + 10;
static const int OO = 0x3fffffff;
inline int read() {
  int ret = 0, f = 1;
  char c;
  while (c = getchar(), !isdigit(c)) f = c == 45 ? -1 : 1;
  while (isdigit(c)) {
    ret = (ret << 3) + (ret << 1);
    ret += c - 48;
    c = getchar();
  }
  return f * ret;
}
template <class T>
inline bool scan_d(T &ret) {
  char c;
  int sgn;
  if (c = getchar(), c == EOF) return 0;
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  sgn = (c == '-') ? -1 : 1;
  ret = (c == '-') ? 0 : (c - '0');
  while (c = getchar(), c >= '0' && c <= '9') ret = ret * 10 + (c - '0');
  ret *= sgn;
  return 1;
}
struct Node {
  int l, r, id;
} q[MAXN];
int n, m;
int cnt[MAXN];
int belong[MAXN], block;
long long ans;
int arr[MAXN];
long long out[MAXN];
bool cmp(Node a, Node b) {
  if (a.l / block != b.l / block) {
    return a.l / block < b.l / block;
  }
  return a.r < b.r;
}
inline void build() {
  block = sqrt(n);
  sort(q + 1, q + 1 + m, cmp);
}
inline void remove(int x) {
  ans -= 1ll * cnt[x] * cnt[x] * x;
  --cnt[x];
  ans += 1ll * cnt[x] * cnt[x] * x;
}
inline void add(int x) {
  ans -= 1ll * cnt[x] * cnt[x] * x;
  ++cnt[x];
  ans += 1ll * cnt[x] * cnt[x] * x;
}
void mo() {
  int l = 1, r = 1;
  cnt[arr[l]] = 1;
  ans = arr[l];
  for (register int i = 1; i <= m; ++i) {
    while (l < q[i].l) {
      remove(arr[l]);
      ++l;
    }
    while (l > q[i].l) {
      --l;
      add(arr[l]);
    }
    while (r > q[i].r) {
      remove(arr[r]);
      --r;
    }
    while (r < q[i].r) {
      ++r;
      add(arr[r]);
    }
    out[q[i].id] = ans;
  }
}
inline void print(long long x) {
  if (x > 9) print(x / 10);
  putchar(x % 10 + '0');
}
int main() {
  n = read();
  m = read();
  for (register int i = 1; i <= n; ++i) {
    arr[i] = read();
  }
  for (register int i = 1; i <= m; ++i) {
    q[i].l = read();
    q[i].r = read();
    q[i].id = i;
  }
  build();
  mo();
  for (register int i = 1; i <= m; ++i) {
    print(out[i]);
    puts("");
  }
}
