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>
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
long long int gcd(long long int a, long long int b) {
  return (a ? gcd(b % a, a) : b);
}
long long int modPow(long long int a, long long int b, long long int MOD) {
  long long int x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % MOD;
    }
    b /= 2;
    y = (y * y) % MOD;
  }
  return x;
}
long long int modInverse(long long int a, long long int p) {
  return modPow(a, p - 2, p);
}
using namespace std;
const int N = 2e5 + 5;
const int S = 1e6 + 6;
int freq[S];
long long int arr[N];
long long int ans[N];
long long int curr;
int BLOCK;
struct node {
  int L;
  int R;
  int i;
} Q[N];
bool cmp(node x, node y) {
  if (x.L / BLOCK != y.L / BLOCK)
    return x.L / BLOCK < y.L / BLOCK;
  else
    return x.R < y.R;
}
inline void calculate(int val, int op) {
  curr = curr + 2 * op * freq[val] * val + val;
  freq[val] += op;
}
void add(int val) { calculate(val, 1); }
void remove(int val) { calculate(val, -1); }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q, l, r, i, j, k;
  cin >> n >> q;
  BLOCK = sqrt(n);
  for (int i = 0; i < (n); i++) cin >> arr[i];
  for (int i = 0; i < (q); i++) {
    cin >> l >> r;
    Q[i].L = l;
    Q[i].R = r;
    Q[i].i = i;
    Q[i].L--;
    Q[i].R--;
  }
  sort(Q, Q + q, cmp);
  int currentL = 0;
  int currentR = -1;
  for (int i = 0; i < (q); i++) {
    int left = Q[i].L;
    int right = Q[i].R;
    if (i == 0 || Q[i].L / BLOCK != Q[i - 1].L / BLOCK) {
      memset(freq, 0, sizeof(freq));
      curr = 0;
      for (int j = (Q[i].L); j <= (Q[i].R); j++) add(arr[j]);
      currentL = Q[i].L;
      currentR = Q[i].R;
      ans[Q[i].i] = curr;
    } else {
      while (currentR < right) {
        currentR++;
        add(arr[currentR]);
      }
      while (currentL > left) {
        currentL--;
        add(arr[currentL]);
      }
      while (currentR > right) {
        remove(arr[currentR]);
        currentR--;
      }
      while (currentL < left) {
        remove(arr[currentL]);
        currentL++;
      }
      ans[Q[i].i] = curr;
    }
  }
  for (int i = 0; i < (q); i++) cout << ans[i] << "\n";
  return 0;
}
