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 n_max = 200200;
struct Query {
  int left, right;
  int block;
  int id;
  long long ans;
  Query(int l_, int r_, int b_, int i_, long long a_) {
    left = l_;
    right = r_;
    block = b_;
    id = i_;
    ans = a_;
  }
};
int A[n_max], n, q, u, v, S;
vector<Query> Q;
vector<int> Freq(1000010, 0);
long long sum = 0;
bool compareQuery(Query A, Query B) {
  if (A.block != B.block) return A.block < B.block;
  return A.right < B.right;
}
bool by_index(Query A, Query B) { return A.id < B.id; }
void insElement(int value) {
  sum += ((long long)(2 * Freq[value] + 1)) * ((long long)value);
  Freq[value] += 1;
}
void delElement(int value) {
  sum -= ((long long)(2 * Freq[value] - 1)) * ((long long)value);
  Freq[value] -= 1;
}
long long getAns(Query preQ, Query curQ) {
  if (preQ.left <= curQ.left)
    for (int i = preQ.left; i < curQ.left; i++) delElement(A[i]);
  else
    for (int i = curQ.left; i < preQ.left; i++) insElement(A[i]);
  if (preQ.right <= curQ.right)
    for (int i = preQ.right + 1; i <= curQ.right; i++) insElement(A[i]);
  else
    for (int i = curQ.right + 1; i <= preQ.right; i++) delElement(A[i]);
  return sum;
}
int main() {
  cin >> n >> q;
  sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  S = (int)round(sqrt(n) + 1.0);
  for (int i = 0; i < q; i++) {
    cin >> u >> v;
    u--;
    v--;
    Q.push_back(Query(u, v, u / S, i, 0));
  }
  sort(Q.begin(), Q.end(), compareQuery);
  if (Q.size() != 0) {
    for (int i = Q[0].left; i <= Q[0].right; i++) {
      insElement(A[i]);
    }
    Q[0].ans = sum;
    for (int i = 0; i < q - 1; i++) Q[i + 1].ans = getAns(Q[i], Q[i + 1]);
  };
  sort(Q.begin(), Q.end(), by_index);
  for (int i = 0; i < Q.size(); i++) cout << Q[i].ans << endl;
}
