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;
int nodes, q, arr[200005], total[1000005] = {}, blok, batas1, batas2, kiri,
                           kanan;
unsigned long long jawaban = 0, ans[200005];
struct apapun1 {
  int kiri, kanan, indeks;
  friend bool operator<(apapun1 a, apapun1 b) {
    if (a.kiri / blok == b.kiri / blok) return (a.kanan < b.kanan);
    return (a.kiri / blok < b.kiri / blok);
  }
} coba1, temp1;
vector<apapun1> query;
void pairing1(int kiri, int kanan, int indeks) {
  coba1.kiri = kiri;
  coba1.kanan = kanan;
  coba1.indeks = indeks;
}
void add(int indeks) {
  jawaban -= (long long)total[arr[indeks]] * total[arr[indeks]] * arr[indeks];
  total[arr[indeks]]++;
  jawaban += (long long)total[arr[indeks]] * total[arr[indeks]] * arr[indeks];
}
void remove(int indeks) {
  jawaban -= (long long)total[arr[indeks]] * total[arr[indeks]] * arr[indeks];
  total[arr[indeks]]--;
  jawaban += (long long)total[arr[indeks]] * total[arr[indeks]] * arr[indeks];
}
int main() {
  scanf("%d%d", &nodes, &q);
  blok = ceil(sqrt(nodes));
  for (int i = 1; i <= nodes; i++) {
    scanf("%d", &arr[i]);
  }
  for (int i = 1; i <= q; i++) {
    scanf("%d%d", &batas1, &batas2);
    pairing1(batas1, batas2, i);
    query.push_back(coba1);
  }
  sort(query.begin(), query.end());
  kiri = 1;
  kanan = 1;
  add(1);
  for (int i = 0; i < q; i++) {
    temp1 = query[i];
    while (kiri < temp1.kiri) {
      remove(kiri);
      kiri++;
    }
    while (kiri > temp1.kiri) {
      kiri--;
      add(kiri);
    }
    while (kanan < temp1.kanan) {
      kanan++;
      add(kanan);
    }
    while (kanan > temp1.kanan) {
      remove(kanan);
      kanan--;
    }
    ans[temp1.indeks] = jawaban;
  }
  for (int i = 1; i <= q; i++) {
    cout << ans[i] << endl;
  }
}
