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 = 2e6 + 5;
int n, SQR, q;
long long freq[N], a[N];
long long Ans[N], res;
struct Query {
  long long L, R, Index, Bucket_index;
} Range[N];
inline bool comp(Query x, Query y) {
  if (x.Bucket_index != y.Bucket_index) return x.Bucket_index < y.Bucket_index;
  if (x.Bucket_index & 1) return x.R < y.R;
  return x.R > y.R;
}
void Add(int i) {
  res -= freq[a[i]] * freq[a[i]] * a[i];
  freq[a[i]]++;
  res += freq[a[i]] * freq[a[i]] * a[i];
}
void Remove(int i) {
  res -= freq[a[i]] * freq[a[i]] * a[i];
  freq[a[i]]--;
  res += freq[a[i]] * freq[a[i]] * a[i];
}
void solve() {
  sort(Range + 1, Range + q + 1, comp);
  int CL = 2, CR = 1;
  for (int i = 1; i <= q; ++i) {
    while (CL < Range[i].L) Remove(CL++);
    while (CL > Range[i].L) Add(--CL);
    while (CR < Range[i].R) Add(++CR);
    while (CR > Range[i].R) Remove(CR--);
    Ans[Range[i].Index] = res;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  scanf("%d %d", &n, &q);
  SQR = sqrt(n) + 1;
  for (int i = 1; i <= n; ++i) scanf("%lld", a + i);
  for (int i = 1; i <= q; i++) {
    long long L, R;
    scanf("%lld %lld", &L, &R);
    Range[i].Index = i;
    Range[i].Bucket_index = L / SQR;
    Range[i].L = L;
    Range[i].R = R;
  }
  solve();
  for (int i = 1; i <= q; i++) printf("%lld \n", Ans[i]);
}
