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 MOD = (int)1e9 + 7;
const int MOD2 = MOD + 2;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
int modulo(int a, int b) { return (a % b + b) % b; }
int n, t, block;
long long ans = 0;
vector<int> a;
struct query {
  int l, r, id;
};
vector<query> queries;
vector<int> cnt(1000100, 0);
bool cmp(query q1, query q2) {
  if (q1.l / block < q2.l / block) return true;
  if (q1.l / block == q2.l / block && q1.r < q2.r) {
    return true;
  }
  return false;
}
void add(long long pos) {
  int c = cnt[a[pos]];
  ans -= 1LL * c * c * a[pos];
  cnt[a[pos]]++;
  c = cnt[a[pos]];
  ans += 1LL * c * c * a[pos];
}
void remove(long long pos) {
  int c = cnt[a[pos]];
  ans -= 1LL * c * c * a[pos];
  cnt[a[pos]]--;
  c = cnt[a[pos]];
  ans += 1LL * c * c * a[pos];
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n >> t;
  a = vector<int>(n);
  for (int i = (0); i <= (n - 1); i++) {
    cin >> a[i];
  }
  block = sqrt(n);
  queries = vector<query>(t);
  for (int i = (0); i <= (t - 1); i++) {
    cin >> queries[i].l >> queries[i].r;
    queries[i].l--;
    queries[i].r--;
    queries[i].id = i;
  }
  sort(queries.begin(), queries.end(), cmp);
  int curl = 0, curr = 0;
  vector<long long> val(t);
  for (int i = (0); i <= (t - 1); i++) {
    long long l = queries[i].l;
    long long r = queries[i].r;
    while (curl < l) {
      remove(curl);
      curl++;
    }
    while (curl > l) {
      curl--;
      add(curl);
    }
    while (curr > r + 1) {
      remove(curr - 1);
      curr--;
    }
    while (curr <= r) {
      add(curr);
      curr++;
    }
    val[queries[i].id] = ans;
  }
  for (int i = (0); i <= (t - 1); i++) {
    cout << val[i] << "\n";
  }
  return 0;
}
