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;
long long int n, m, s;
long long int t[200000], p[1000001];
vector<pair<long long int, pair<long long int, long long int>>> v(200000);
vector<pair<long long int, long long int>> ans(200000);
long long int block(long long int x) { return x / s; }
bool cmp1(pair<long long int, pair<long long int, long long int>> a,
          pair<long long int, pair<long long int, long long int>> b) {
  if (block(a.second.first) != block(b.second.first))
    return block(a.second.first) < block(b.second.first);
  if (block(a.second.first) % 2 == 0)
    return a.second.second < b.second.second;
  else
    return b.second.second < a.second.second;
}
bool cmp2(pair<long long int, long long int> a,
          pair<long long int, long long int> b) {
  if (a.first < b.first)
    return 1;
  else
    return 0;
}
void solve() {
  long long int r(-1), l(0);
  long long int sum(0);
  for (long long int i = 0; i < m; i++) {
    while (r < v[i].second.second) {
      r++;
      sum += t[r] * (2 * p[t[r]] + 1);
      p[t[r]]++;
    }
    while (l > v[i].second.first) {
      l--;
      sum += t[l] * (2 * p[t[l]] + 1);
      p[t[l]]++;
    }
    while (r > v[i].second.second) {
      sum -= t[r] * (2 * p[t[r]] - 1);
      p[t[r]]--;
      r--;
    }
    while (l < v[i].second.first) {
      sum -= t[l] * (2 * p[t[l]] - 1);
      p[t[l]]--;
      l++;
    }
    ans[i].first = v[i].first;
    ans[i].second = sum;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (long long int i = 0; i < n; i++) cin >> t[i];
  s = n / sqrt(m);
  if (s == 0) s++;
  for (long long int i = 0; i < m; i++) {
    v[i].first = i;
    cin >> v[i].second.first >> v[i].second.second;
    v[i].second.first--;
    v[i].second.second--;
  }
  sort(v.begin(), v.begin() + m, cmp1);
  memset(p, 0, sizeof(p));
  solve();
  sort(ans.begin(), ans.begin() + m, cmp2);
  for (long long int i = 0; i < m; i++) cout << ans[i].second << endl;
  return 0;
}
