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 CUT = 2000;
int MAX = 1000 * 1000 + 1;
struct Query {
  int l, r, index;
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, numqueries;
  cin >> n >> numqueries;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<long long> answers(numqueries);
  vector<Query> queries(numqueries);
  for (int query = 0; query < numqueries; query++) {
    int l, r;
    cin >> l >> r;
    queries[query].index = query;
    queries[query].l = l - 1;
    queries[query].r = r - 1;
  }
  vector<bool> need(MAX);
  vector<int> count(MAX);
  for (int i = 0; i < n; i++) count[a[i]]++;
  vector<long long> singleprefix(n + 1);
  for (int i = 1; i <= n; i++) {
    if (count[a[i - 1]] == 1)
      singleprefix[i] = singleprefix[i - 1] + a[i - 1];
    else
      singleprefix[i] = singleprefix[i - 1];
  }
  for (Query q : queries)
    answers[q.index] += singleprefix[q.r + 1] - singleprefix[q.l];
  vector<int> prefix(n + 1);
  for (int val = 1; val < MAX; val++) {
    if (count[val] >= CUT) {
      prefix[0] = 0;
      for (int i = 1; i <= n; i++)
        prefix[i] = prefix[i - 1] + (a[i - 1] == val ? 1 : 0);
      for (Query q : queries) {
        int cc = prefix[q.r + 1] - prefix[q.l];
        answers[q.index] += (long long)cc * cc * val;
      }
    }
  }
  for (int i = 1; i < MAX; i++)
    if (count[i] > 1 && count[i] < CUT) need[i] = true;
  count = vector<int>(MAX);
  int blocks = (int)sqrt(n);
  int blocksize = (n + blocks - 1) / blocks;
  sort(queries.begin(), queries.end(), [&](const Query& a, const Query& b) {
    int ablock = a.l / blocksize;
    int bblock = b.l / blocksize;
    if (ablock != bblock) return ablock < bblock;
    return a.r < b.r;
  });
  int leftindex = 0, rightindex = -1;
  long long res = 0;
  for (Query& q : queries) {
    while (rightindex < q.r) {
      rightindex++;
      int nval = a[rightindex];
      if (!need[nval]) continue;
      int prevcount = count[nval];
      res -= (long long)prevcount * prevcount * nval;
      count[nval]++;
      res += (long long)(prevcount + 1) * (prevcount + 1) * nval;
    }
    while (rightindex > q.r) {
      int nval = a[rightindex];
      rightindex--;
      if (!need[nval]) continue;
      int prevcount = count[nval];
      res -= (long long)prevcount * prevcount * nval;
      count[nval]--;
      res += (long long)(prevcount - 1) * (prevcount - 1) * nval;
    }
    while (leftindex < q.l) {
      int nval = a[leftindex];
      leftindex++;
      if (!need[nval]) continue;
      int prevcount = count[nval];
      res -= (long long)prevcount * prevcount * nval;
      count[nval]--;
      res += (long long)(prevcount - 1) * (prevcount - 1) * nval;
    }
    while (leftindex > q.l) {
      leftindex--;
      int nval = a[leftindex];
      if (!need[nval]) continue;
      int prevcount = count[nval];
      res -= (long long)prevcount * prevcount * nval;
      count[nval]++;
      res += (long long)(prevcount + 1) * (prevcount + 1) * nval;
    }
    answers[q.index] += res;
  }
  for (auto l : answers) cout << l << "\n";
}
