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 INF = 1 << 30;
const long long LLINF = 1LL << 62;
const int mod = 1000000007;
int buffer = 1 << 13;
int cnt = buffer - 1;
char buff[10005];
char gchar() {
  if (++cnt == buffer) {
    cnt = 0;
    fread(buff, buffer, 1, stdin);
  }
  return buff[cnt];
}
int gint() {
  int x = 0;
  char c = gchar();
  while (c < '0' || '9' < c) c = gchar();
  while ('0' <= c && c <= '9') {
    x = x * 10 + c - '0';
    c = gchar();
  }
  return x;
}
int n, m, k, i, j, block, lstblock, rgt, lgt;
int v[200005], values[200005], f[1000005], ltlf[1000005];
long long sol, partsol, res[200005];
pair<pair<int, int>, int> q[200005];
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / lgt == b.first.first / lgt)
    return a.first.second < b.first.second;
  return (a.first.first / lgt) < (b.first.first / lgt);
}
int main() {
  n = gint();
  m = gint();
  for (i = 0; i < n; i++) {
    v[i] = gint();
    f[v[i]]++;
    if (f[v[i]] == 1) values[++k] = v[i];
  }
  for (i = 1; i <= m; i++) {
    q[i].first.first = gint() - 1;
    q[i].first.second = gint() - 1;
    q[i].second = i;
  }
  for (lgt = 1; lgt * lgt <= n; lgt++)
    ;
  lgt--;
  if (!lgt) lgt = 1;
  sort(q + 1, q + m + 1, cmp);
  lstblock = -1;
  for (i = 1; i <= m; i++) {
    if (q[i].first.second / lgt == q[i].first.first / lgt) {
      partsol = 0;
      for (j = q[i].first.first; j <= q[i].first.second; j++) {
        ltlf[v[j]]++;
        partsol += 1LL * (ltlf[v[j]] * 2 - 1) * v[j];
      }
      res[q[i].second] = partsol;
      for (j = q[i].first.first; j <= q[i].first.second; j++) ltlf[v[j]]--;
      continue;
    }
    block = q[i].first.first / lgt;
    if (block != lstblock) {
      for (j = 1; j <= k; j++) f[values[j]] = 0;
      sol = 0;
      rgt = (block + 1) * lgt - 1;
    }
    for (j = rgt + 1; j <= q[i].first.second; j++) {
      f[v[j]]++;
      sol += 1LL * (2 * f[v[j]] - 1) * v[j];
    }
    rgt = q[i].first.second;
    partsol = sol;
    for (j = q[i].first.first; j < (block + 1) * lgt; j++) {
      f[v[j]]++;
      partsol += 1LL * (2 * f[v[j]] - 1) * v[j];
    }
    res[q[i].second] = partsol;
    for (j = q[i].first.first; j < (block + 1) * lgt; j++) f[v[j]]--;
    lstblock = block;
  }
  for (i = 1; i <= m; i++) printf("%I64d\n", res[i]);
  return 0;
}
