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;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pci = pair<char, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
const ll infll = 1e18 + 3;
const int maxn = 1e6 + 77;
const int nmax = 1e6 + 577;
const ll basell = 1e18 + 3;
const ld eps = 1e-7;
const int inf = 1009000999;
const int nv = 100505;
const int baseint = 1000200013;
const ld PI = acos(-1.0);
inline bool EQ(ld a, ld b) { return fabs(a - b) < 1e-9; }
inline bool IF(int a, int b, int c) { return (a >= b && a <= c); }
inline bool IFS(int a, int b, int c) { return (a > b && a < c); }
const int N = 200000 + 77, Sq = 447;
int n, q, a[N], P[N], Ql[N], Qr[N], T[N * 5];
ll A[N];
bool CMP(int x, int y) {
  int B1 = Ql[x] / Sq, B2 = Ql[y] / Sq;
  if (B1 == B2) {
    return Qr[x] < Qr[y];
  }
  return B1 < B2;
}
int inline solve() {
  ios::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
  ;
  cin >> n >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i <= q; i++) {
    cin >> Ql[i] >> Qr[i];
    P[i] = i;
  }
  sort(P + 1, P + 1 + q, CMP);
  int le = 1, ri = 1;
  T[a[1]]++;
  ll res = a[1];
  for (int i = 1; i <= q; i++) {
    int id = P[i];
    int nl = Ql[id], nr = Qr[id];
    while (nl < le) {
      --le;
      res += (T[a[le]] * 1ll * 2 + 1) * 1ll * a[le];
      T[a[le]]++;
    }
    while (ri < nr) {
      ++ri;
      res += (T[a[ri]] * 1ll * 2 + 1) * 1ll * a[ri];
      T[a[ri]]++;
    }
    while (le < nl) {
      res -= (T[a[le]] * 1ll * 2 - 1) * 1ll * a[le];
      T[a[le]]--;
      ++le;
    }
    while (nr < ri) {
      res -= (T[a[ri]] * 1ll * 2 - 1) * 1ll * a[ri];
      T[a[ri]]--;
      --ri;
    }
    A[id] = res;
  }
  for (int i = 1; i <= q; i++) {
    cout << A[i] << '\n';
  }
  return 0;
}
int32_t main() {
  solve();
  return 0;
}
