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;
typedef struct node {
  int l;
  int r;
  int index;
} node;
int n;
int sqn;
long long int a[200005];
long long freq[1000006];
long long int answer = 0, ans[200006];
struct node query[200006];
bool f(node A, node B) {
  if (A.l / sqn < B.l / sqn) return true;
  if (A.l / sqn > B.l / sqn) return false;
  return A.r < B.r;
}
int main() {
  int n, q, i;
  scanf("%d %d", &n, &q);
  sqn = sqrt(n);
  for (i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    freq[a[i]] = 0;
  }
  for (i = 0; i < q; i++) {
    scanf("%d %d", &query[i].l, &query[i].r);
    query[i].l -= 1;
    query[i].r -= 1;
    query[i].index = i;
  }
  sort(query, query + q, f);
  int prevl, prevr, currl, currr;
  prevl = query[0].l;
  prevr = query[0].r;
  currl = prevl;
  currr = prevr;
  for (i = prevl; i <= prevr; i++) {
    answer = answer + 2 * freq[a[i]] * a[i] + a[i];
    freq[a[i]] += 1;
  }
  ans[query[0].index] = answer;
  i = 1;
  while (i < q) {
    currl = query[i].l;
    currr = query[i].r;
    while (prevl < currl) {
      answer = answer - 2 * freq[a[prevl]] * a[prevl] + a[prevl];
      freq[a[prevl]] -= 1;
      prevl += 1;
    }
    while (prevl > currl) {
      prevl -= 1;
      answer = answer + 2 * freq[a[prevl]] * a[prevl] + a[prevl];
      freq[a[prevl]] += 1;
    }
    while (prevr > currr) {
      answer = answer - 2 * freq[a[prevr]] * a[prevr] + a[prevr];
      freq[a[prevr]] -= 1;
      prevr -= 1;
    }
    while (prevr < currr) {
      prevr += 1;
      answer = answer + 2 * freq[a[prevr]] * a[prevr] + a[prevr];
      freq[a[prevr]] += 1;
    }
    ans[query[i].index] = answer;
    i += 1;
  }
  for (i = 0; i < q; i++) printf("%lld\n", ans[i]);
  return 0;
}
