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;
inline void fastRead(int *a) {
  register char c = 0;
  while (c < 33) c = getchar();
  *a = 0;
  while (c > 33) {
    *a = *a * 10 + c - '0';
    c = getchar();
  }
}
inline void fastWrite(long long int a) {
  char snum[20];
  int i = 0;
  do {
    snum[i++] = a % 10 + 48;
    a = a / 10;
  } while (a != 0);
  i = i - 1;
  while (i >= 0) putchar(snum[i--]);
  putchar('\n');
}
const int block = 450;
int n;
int arr[200005];
long long int ans[200005];
int num[1000005];
long long int sum;
bool cmp(pair<pair<int, int>, int> p1, pair<pair<int, int>, int> p2) {
  if (p1.first.first / block == p2.first.first / block)
    return p1.first.second / block < p2.first.second / block;
  return p1.first.first / block < p2.first.first / block;
}
void add(int pos) {
  int nn = arr[pos];
  sum -= (1LL * num[nn] * num[nn]) * 1LL * nn;
  num[arr[pos]]++;
  sum += (1LL * num[nn] * num[nn]) * 1LL * nn;
}
void remove(int pos) {
  long long int nn = arr[pos];
  sum -= (1LL * num[nn] * num[nn]) * 1LL * nn;
  num[arr[pos]]--;
  sum += (1LL * num[nn] * num[nn]) * 1LL * nn;
}
int main() {
  int n, q;
  fastRead(&n);
  fastRead(&q);
  for (int i = 0; i < n; i++) fastRead(&arr[i]);
  vector<pair<pair<int, int>, int> > v;
  for (int i = 0; i < q; i++) {
    int a, b;
    fastRead(&a);
    fastRead(&b);
    a--, b--;
    v.push_back(make_pair(make_pair(a, b), i));
  }
  sort(v.begin(), v.end(), cmp);
  int l = 0, r = -1;
  for (int i = 0; i < v.size(); i++) {
    int id = v[i].second;
    int l1 = v[i].first.first;
    int r1 = v[i].first.second;
    while (l < l1) {
      remove(l);
      l++;
    }
    while (l > l1) {
      add(l - 1);
      l--;
    }
    while (r < r1) {
      add(r + 1);
      r++;
    }
    while (r > r1) {
      remove(r);
      r--;
    }
    ans[id] = sum;
  }
  for (int i = 0; i < q; i++) fastWrite(ans[i]);
  return 0;
}
