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 n, q, v[200001], sq, freq[1000001], ans, ansi[200001];
vector<pair<long long, pair<long long, long long>>> qs;
bool cmp(pair<long long, pair<long long, long long>> a,
         pair<long long, pair<long long, long long>> b) {
  if (a.first / sq != b.first / sq) {
    if (a.first < b.first) {
      return true;
    }
    return false;
  } else {
    if (a.second < b.second) {
      return true;
    }
    return false;
  }
}
void del(long long val) {
  if (freq[val] > 0) {
    ans -= val * freq[val] * freq[val];
  }
  freq[val] -= 1;
  ans += val * freq[val] * freq[val];
}
void add(long long val) {
  if (freq[val] > 0) {
    ans -= val * freq[val] * freq[val];
  }
  freq[val] += 1;
  ans += val * freq[val] * freq[val];
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(NULL);
  cin.tie(NULL);
  cin >> n >> q;
  sq = sqrt(n);
  for (long long i = 1; i <= n; i += 1) {
    cin >> v[i];
  }
  for (long long i = 0; i < q; i += 1) {
    long long a, b;
    cin >> a >> b;
    qs.push_back({a, {b, i}});
  }
  sort(qs.begin(), qs.end(), cmp);
  long long p1 = 1, p2 = 1;
  for (pair<long long, pair<long long, long long>> i : qs) {
    while (p2 <= i.second.first) {
      add(v[p2]);
      p2 += 1;
    }
    while (p2 > i.second.first + 1) {
      p2 -= 1;
      del(v[p2]);
    }
    while (p1 < i.first) {
      del(v[p1]);
      p1 += 1;
    }
    while (p1 > i.first) {
      p1 -= 1;
      add(v[p1]);
    }
    ansi[i.second.second] = ans;
  }
  for (int i = 0; i < q; i += 1) {
    cout << ansi[i] << '\n';
  }
}
