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 hot = 0;
struct util {
  long long l, r, idx;
  long long ans;
};
util brr[200005];
long long b_size;
long long arr[200005];
long long mp[2000005];
bool comp(util a, util b) {
  long long x = a.l / b_size;
  long long y = b.l / b_size;
  if (x == y)
    return a.r < b.r;
  else
    return x < y;
}
void add(long long val) {
  hot -= (mp[val] * mp[val] * val);
  mp[val]++;
  hot += (mp[val] * mp[val] * val);
}
void rem(long long val) {
  hot -= (mp[val] * mp[val] * val);
  mp[val]--;
  hot += (mp[val] * mp[val] * val);
}
bool comp2(util a, util b) {
  if (a.idx < b.idx)
    return true;
  else
    return false;
}
int main() {
  long long n, q;
  scanf("%lld", &n);
  ;
  b_size = (long long)sqrt(n);
  scanf("%lld", &q);
  ;
  for (long long i = 0; i < n; i++) scanf("%lld", &arr[i]);
  ;
  for (long long i = 0; i < q; i++) {
    brr[i].idx = i;
    long long x, y;
    scanf("%lld", &x);
    ;
    scanf("%lld", &y);
    ;
    x--;
    y--;
    brr[i].l = x;
    brr[i].r = y;
  }
  sort(brr, brr + q, comp);
  long long l1 = 0, r1 = -1;
  for (long long i = 0; i < q; i++) {
    while (r1 < brr[i].r) {
      r1++;
      add(arr[r1]);
    }
    while (r1 > brr[i].r) {
      rem(arr[r1]);
      r1--;
    }
    while (l1 < brr[i].l) {
      rem(arr[l1]);
      l1++;
    }
    while (l1 > brr[i].l) {
      l1--;
      add(arr[l1]);
    }
    brr[i].ans = hot;
  }
  sort(brr, brr + q, comp2);
  for (long long i = 0; i < q; i++) cout << brr[i].ans << "\n";
}
