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 query {
  int l, r, ind, bl;
  query() {
    l = 0;
    r = 0;
    ind = 0;
    bl = 0;
  }
  query(int a, int b, int c) {
    l = a;
    r = b;
    ind = c;
    bl = l / 570;
  }
  bool operator<(const query a) {
    if (bl != a.bl) return bl < a.bl;
    if (r != a.r)
      return r < a.r;
    else
      return l < a.l;
  }
};
int n;
vector<int> a;
vector<int> d;
vector<query> q;
vector<long long> aq;
bool comp(query a, query b) { return a < b; }
int main() {
  int t;
  scanf("%d%d", &n, &t);
  a.assign(n + 10, 0);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  d.assign(1005000, 0);
  aq.assign(t + 10, 0);
  if (t <= 0) return 0;
  for (int i = 0; i < t; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    q.push_back(query(l, r, i));
  }
  sort(q.begin(), q.end(), comp);
  long long ans = 0;
  for (int i = q[0].l; i <= q[0].r; i++) {
    ans -= (1LL * d[a[i]] * d[a[i]] * a[i]);
    d[a[i]]++;
    ans += (1LL * d[a[i]] * d[a[i]] * a[i]);
  }
  aq[q[0].ind] = ans;
  int ul = q[0].l, ur = q[0].r;
  for (int i = 1; i < t; i++) {
    for (int u = ul; u < q[i].l; u++) {
      ans -= (1LL * d[a[u]] * d[a[u]] * a[u]);
      d[a[u]]--;
      ans += (1LL * d[a[u]] * d[a[u]] * a[u]);
    }
    for (int u = q[i].l; u < ul; u++) {
      ans -= (1LL * d[a[u]] * d[a[u]] * a[u]);
      d[a[u]]++;
      ans += (1LL * d[a[u]] * d[a[u]] * a[u]);
    }
    ul = q[i].l;
    for (int u = ur + 1; u <= q[i].r; u++) {
      ans -= (1LL * d[a[u]] * d[a[u]] * a[u]);
      d[a[u]]++;
      ans += (1LL * d[a[u]] * d[a[u]] * a[u]);
    }
    for (int u = q[i].r + 1; u <= ur; u++) {
      ans -= (1LL * d[a[u]] * d[a[u]] * a[u]);
      d[a[u]]--;
      ans += (1LL * d[a[u]] * d[a[u]] * a[u]);
    }
    ur = q[i].r;
    aq[q[i].ind] = ans;
  }
  for (int i = 0; i < t; i++) printf("%I64d\n", aq[i]);
  return 0;
}
