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 int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return a * (b / gcd(a, b));
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b & 1) ans = ((ans % 1000000007) * (a % 1000000007)) % 1000000007;
    a = ((a % 1000000007) * (a % 1000000007)) % 1000000007;
    b >>= 1;
  }
  return ans;
}
struct node {
  int first, second, ans;
};
long long int sum = 0;
vector<vector<node> > adj;
int c[1000010], arr[200010], i, n;
long long int query[200010];
void add(int ind) {
  if (ind == 0 || ind == n + 1) return;
  int temp = arr[ind];
  sum += (long long int)(2 * c[temp] + 1) * (long long int)temp;
  ++c[temp];
  return;
}
void remove(int ind) {
  if (ind == 0 || ind == n + 1) return;
  int temp = arr[ind];
  sum -= (long long int)(2 * c[temp] - 1) * (long long int)temp;
  --c[temp];
  return;
}
bool compare(node A, node B) { return (A.second < B.second); }
int main() {
  int t;
  cin >> n >> t;
  int maximum = -1;
  for (i = 1; i < n + 1; i++) {
    cin >> arr[i];
    maximum = max(maximum, arr[i]);
  }
  int temp = sqrt(n);
  int T = t;
  adj.resize((n / temp) + 2);
  for (i = 1; i < T + 1; i++) {
    int l, r;
    cin >> l >> r;
    node tem;
    tem.first = l;
    tem.second = r;
    tem.ans = i;
    if (l % temp == 0)
      adj[l / temp].push_back(tem);
    else
      adj[(l / temp) + 1].push_back(tem);
  }
  for (i = 1; i < (n / temp) + 2; i++)
    sort(adj[i].begin(), adj[i].end(), compare);
  for (i = 1; i < (n / temp) + 2; i++) {
    memset(c, 0, sizeof(c));
    sum = 0;
    int L, R;
    int start = (i - 1) * temp;
    int end = start;
    for (auto it : adj[i]) {
      L = it.first;
      R = it.second;
      while (end <= R) {
        add(end);
        end++;
      }
      while (start > L) {
        add(start - 1);
        start--;
      }
      while (start < L) {
        remove(start);
        start++;
      }
      query[it.ans] = sum;
    }
  }
  for (i = 1; i < T + 1; i++) cout << query[i] << endl;
  return 0;
}
