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;
const int N_NUM_MAX = 201000;
const int N_QUERY_MAX = 201000;
const int SQRT_N_QUERY_MAX = 448;
const int NUM_RANGE_MAX = 1000001;
struct Query {
  int idx, l, r;
  Query(int _idx = 0, int _l = 0, int _r = 0) : idx(_idx), l(_l), r(_r) {}
};
vector<Query> query[SQRT_N_QUERY_MAX][SQRT_N_QUERY_MAX];
int num[N_NUM_MAX];
int freq[NUM_RANGE_MAX];
long long ans[N_QUERY_MAX], now;
int n_num, n_query, n_blk, blksize;
int main() {
  scanf("%d%d", &n_num, &n_query);
  blksize = (int)sqrt(n_num);
  n_blk = (int)ceil((double)n_num / blksize);
  for (int i = 1; i <= n_num; i++) scanf("%d", &num[i]);
  for (int i = 1, l, r; i <= n_query; i++) {
    scanf("%d%d", &l, &r);
    int a = (int)ceil((double)l / blksize), b = (int)ceil((double)r / blksize);
    query[a][b].push_back(Query(i, l, r));
  }
  for (int i = 1; i <= n_blk; i++) {
    now = 0;
    memset(freq, 0, sizeof(freq));
    for (int j = i; j <= n_blk; j++) {
      for (int k = (j - 1) * blksize + 1; k <= j * blksize; k++)
        now += num[k] * (1 + 2 * freq[num[k]]), freq[num[k]]++;
      for (vector<Query>::iterator it = query[i][j].begin();
           it != query[i][j].end(); it++) {
        int l = it->l, r = it->r;
        for (int k = (i - 1) * blksize + 1; k < l; k++)
          now += -1 * num[k] * (2 * freq[num[k]] - 1), freq[num[k]]--;
        for (int k = r + 1; k <= j * blksize; k++)
          now += -1 * num[k] * (2 * freq[num[k]] - 1), freq[num[k]]--;
        ans[it->idx] = now;
        for (int k = (i - 1) * blksize + 1; k < l; k++)
          now += num[k] * (1 + 2 * freq[num[k]]), freq[num[k]]++;
        for (int k = r + 1; k <= j * blksize; k++)
          now += num[k] * (1 + 2 * freq[num[k]]), freq[num[k]]++;
      }
    }
  }
  for (int i = 1; i <= n_query; i++)
    printf(
        "%lld"
        "\n",
        ans[i]);
}
