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 = 0x3f3f3f3f;
long long B;
typedef struct query {
  int l, r, id;
} qry;
bool cmp(qry a, qry b) {
  if (a.l / B != b.l / B)
    return (a.l < b.l);
  else
    return (a.r < b.r);
}
int freq[1000055] = {0};
long long add(long long a[], long long n, long long id) {
  long long res = 0;
  freq[a[id]]++;
  res = ((2 * freq[a[id]]) - 1) * a[id];
  return (res);
}
long long remov(long long a[], long long n, long long id) {
  long long res = 0;
  res = (2 * freq[a[id]] - 1) * a[id];
  freq[a[id]]--;
  return res;
}
void solve(long long a[], long long n, qry q[], long long t, long long ans[]) {
  long long st = 0, end = 0, i, j, k, cnt = 0;
  for (i = 0; i < t; i++) {
    j = q[i].l;
    k = q[i].r;
    while (st > j) {
      cnt += add(a, n, st - 1);
      st--;
    }
    while (st < j) {
      cnt -= remov(a, n, st);
      st++;
    }
    while (end <= k) {
      cnt += add(a, n, end);
      end++;
    }
    while (end > k + 1) {
      cnt -= remov(a, n, end - 1);
      end--;
    }
    ans[q[i].id] = cnt;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long t, n, i, j, k, x, y;
  cin >> n >> t;
  B = sqrt(n);
  long long a[n], ans[t];
  qry q[t];
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < t; i++) {
    cin >> q[i].l >> q[i].r;
    q[i].l--;
    q[i].r--;
    q[i].id = i;
  }
  sort(q, q + t, cmp);
  solve(a, n, q, t, ans);
  for (i = 0; i < t; i++) cout << ans[i] << endl;
  return 0;
}
