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 char nl = '\n';
long long int power(long long int x, unsigned int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % 1000000007ll;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
long long int ar[500005];
long long int n, q, S;
class Query {
 public:
  long long int l;
  long long int r;
  long long int index;
  long long int answer;
};
bool cmp(Query A, Query B) {
  if (A.l / S != B.l / S) return A.l / S < B.l / S;
  return A.r > B.r;
}
void solve() {
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> ar[i];
  vector<Query> v;
  S = sqrt(n);
  vector<pair<long long int, long long int>> p;
  for (int i = 0; i < q; i++) {
    int a, b;
    cin >> a >> b;
    p.push_back({a, b});
    Query *q = new Query;
    q->l = a;
    q->r = b;
    q->index = i;
    v.push_back(*q);
  }
  sort(v.begin(), v.end(), cmp);
  long long int ans = 0;
  long long int fre[1000005] = {0};
  long long int le = 0, ri = 0;
  long long int j = 0;
  while (j < q) {
    long long int L = v[j].l;
    long long int R = v[j].r;
    L--;
    R--;
    while (le < L) {
      ans -= ar[le] * (fre[ar[le]] * fre[ar[le]]);
      fre[ar[le]]--;
      ans += ar[le] * (fre[ar[le]] * fre[ar[le]]);
      le++;
    }
    while (le > L) {
      ans -= ar[le - 1] * (fre[ar[le - 1]] * fre[ar[le - 1]]);
      fre[ar[le - 1]]++;
      ans += ar[le - 1] * (fre[ar[le - 1]] * fre[ar[le - 1]]);
      le--;
    }
    while (ri <= R) {
      ans -= ar[ri] * (fre[ar[ri]] * fre[ar[ri]]);
      fre[ar[ri]]++;
      ans += ar[ri] * (fre[ar[ri]] * fre[ar[ri]]);
      ri++;
    }
    while (ri > R + 1) {
      ans -= ar[ri - 1] * (fre[ar[ri - 1]] * fre[ar[ri - 1]]);
      fre[ar[ri - 1]]--;
      ans += ar[ri - 1] * (fre[ar[ri - 1]] * fre[ar[ri - 1]]);
      ri--;
    }
    v[j].answer = ans;
    j++;
  }
  long long int vec[q + 1];
  for (int i = 0; i < q; i++) {
    vec[v[i].index] = v[i].answer;
  }
  for (int i = 0; i < q; i++) cout << vec[i] << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(NULL);
  ;
  int t = 1;
  while (t--) solve();
}
