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 a[200005];
array<long long, 4> mo[200005];
long long ans[1001005];
long long swap(long long &a, long long &b) {
  a ^= b;
  b ^= a;
  a ^= b;
}
long long query(long long l, long long in, long long r, long long fi) {
  long long answer = 0;
  r--;
  while (r < fi) {
    r++;
    long long val = ans[a[r]];
    answer += ((val + 1) * (val + 1) - val * val) * a[r];
    ans[a[r]]++;
  }
  while (r > fi) {
    r--;
    long long val = ans[a[r + 1]];
    answer -= ((val)*val - (val - 1) * (val - 1)) * a[r];
    ans[a[r + 1]]--;
  }
  while (l > in) {
    l--;
    long long val = ans[a[l]];
    answer += ((val + 1) * (val + 1) - val * val) * a[l];
    ans[a[l]]++;
  }
  while (l < in) {
    l++;
    long long val = ans[a[l - 1]];
    answer += ((val - 1) * (val - 1) - val * val) * a[l - 1];
    ans[a[l - 1]]--;
  }
  return answer;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, q;
  cin >> n >> q;
  for (long long i = 1; i < n + 1; i++) cin >> a[i];
  for (long long i = 0; i < q; i++) {
    long long l, r;
    cin >> l >> r;
    mo[i][0] = l;
    mo[i][1] = r;
    mo[i][2] = i;
  }
  mo[q][0] = 1000000007;
  sort(&mo[0], &mo[q]);
  long long st = -1, end = -1;
  for (long long i = 0; i <= 1001000; i += 1000) {
    st = end;
    for (long long j = st + 1; j < q + 1; j++) {
      if (mo[j][0] < i) st = j;
      if (mo[j][0] >= i + 1000) {
        end = j;
        break;
      }
    }
    st++;
    end--;
    for (long long i = st; i < end + 1; i++) {
      swap(mo[i][0], mo[i][1]);
    }
    sort(&mo[st], &mo[end + 1]);
    for (long long i = st; i < end + 1; i++) {
      swap(mo[i][0], mo[i][1]);
    }
    for (long long i = 0; i < 1000001; i++) ans[i] = 0;
    long long answer = 0;
    long long in = mo[st][0], fi = mo[st][0];
    for (long long i = st; i < end + 1; i++) {
      answer += query(in, mo[i][0], fi, mo[i][1]);
      mo[i][3] = answer;
      in = mo[i][0];
      fi = mo[i][1] + 1;
    }
  }
  for (long long i = 0; i < q; i++) {
    swap(mo[i][0], mo[i][2]);
  }
  sort(&mo[0], &mo[q]);
  for (long long i = 0; i < q; i++) {
    cout << mo[i][3] << endl;
  }
  return 0;
}
