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;
struct Query {
  int l, r, id;
  Query() { l = r = id = 0; }
  Query(int _l, int _r, int _id) {
    l = _l;
    r = _r;
    id = _id;
  }
  bool operator<(const Query &q) const { return (r < q.r); }
};
int n, q, blockSize;
int a[200200], cnt[1000100];
vector<pair<int, int> > queryAt[200200];
long long answer[200200], rightSum;
void init(void) {
  scanf("%d%d", &n, &q);
  for (int i = (1), _b = (n); i <= _b; i = i + 1) scanf("%d", &a[i]);
  for (int i = (1), _b = (q); i <= _b; i = i + 1) {
    int l, r;
    scanf("%d%d", &l, &r);
    queryAt[l].push_back(make_pair(r, i));
  }
  for (int i = (1), _b = (n); i <= _b; i = i + 1)
    if (!queryAt[i].empty()) sort((queryAt[i]).begin(), (queryAt[i]).end());
  while (1LL * blockSize * blockSize <= n) blockSize++;
  blockSize += rand() % 20 - 10;
  if (blockSize < 1) blockSize = 1;
  if (blockSize > n) blockSize = n;
  cerr << blockSize << endl;
}
long long getAnswer(int l, int r) {
  long long res = rightSum;
  for (int i = (l), _b = (r); i <= _b; i = i + 1) {
    cnt[a[i]]++;
    res += (2 * cnt[a[i]] - 1LL) * a[i];
  }
  for (int i = (l), _b = (r); i <= _b; i = i + 1) cnt[a[i]]--;
  return (res);
}
void process(void) {
  int blockL = 1;
  while (blockL <= n) {
    int blockR = min(blockL + blockSize - 1, n);
    memset(cnt, 0, sizeof cnt);
    rightSum = 0;
    vector<Query> outQuery;
    for (int i = (blockL), _b = (blockR); i <= _b; i = i + 1)
      for (__typeof((queryAt[i]).begin()) it = (queryAt[i]).begin();
           it != (queryAt[i]).end(); it++) {
        if (it->first <= blockR)
          answer[it->second] = getAnswer(i, it->first);
        else
          outQuery.push_back(Query(i, it->first, it->second));
      }
    sort((outQuery).begin(), (outQuery).end());
    int pos = blockR;
    for (__typeof((outQuery).begin()) it = (outQuery).begin();
         it != (outQuery).end(); it++) {
      while (pos < it->r) {
        pos++;
        cnt[a[pos]]++;
        rightSum += (2 * cnt[a[pos]] - 1LL) * a[pos];
      }
      answer[it->id] = getAnswer(it->l, blockR);
    }
    blockL += blockSize;
  }
  for (int i = (1), _b = (q); i <= _b; i = i + 1) cout << answer[i] << "\n";
}
int main(void) {
  srand(time(NULL));
  init();
  process();
  return 0;
}
