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 data {
  int l, r, id;
};
int n, t, a[200005], res, c[200005 * 10];
long long ans = 0;
data b[200005];
pair<long long, int> kq[200005];
bool comp(data p, data q) {
  if (p.l / res != q.l / res) return p.l / res < q.l / res;
  return p.r < q.r;
}
bool comp1(pair<long long, int> p, pair<long long, int> q) {
  return p.second < q.second;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> t;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= t; i++) {
    cin >> b[i].l >> b[i].r;
    b[i].id = i;
  }
  res = sqrt(n);
  sort(b + 1, b + t + 1, comp);
  for (int i = b[1].l; i <= b[1].r; i++) {
    ++c[a[i]];
    ans += (long long)(2 * c[a[i]] - 1) * a[i];
  }
  kq[1].first = ans;
  kq[1].second = b[1].id;
  for (int i = 2; i <= t; i++) {
    if (b[i].l < b[i - 1].l) {
      for (int j = b[i].l; j < b[i - 1].l; j++) {
        c[a[j]]++;
        ans += (long long)(c[a[j]] * 2 - 1) * a[j];
      }
    } else {
      for (int j = b[i].l - 1; j >= b[i - 1].l; j--) {
        c[a[j]]--;
        ans -= (long long)(c[a[j]] * 2 + 1) * a[j];
      }
    }
    if (b[i].r > b[i - 1].r) {
      for (int j = b[i - 1].r + 1; j <= b[i].r; j++)
        c[a[j]]++, ans += (long long)(c[a[j]] * 2 - 1) * a[j];
    } else {
      for (int j = b[i].r + 1; j <= b[i - 1].r; j++) {
        c[a[j]]--;
        ans -= (long long)(c[a[j]] * 2 + 1) * a[j];
      }
    }
    kq[i].first = ans;
    kq[i].second = b[i].id;
  }
  sort(kq + 1, kq + t + 1, comp1);
  for (int i = 1; i <= t; i++) cout << kq[i].first << '\n';
  return 0;
}
