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 long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
  return (a % m + b % m + 2 * m) % m;
}
long long mul(long long a, long long b, long long m = MOD) {
  return ((a % m + m) * (b % m + m)) % m;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
  long long res = 1LL;
  a = a % m;
  while (b) {
    if (b & 1) res = mul(res, a, m);
    b >>= 1;
    a = mul(a, a, m);
  }
  return res;
}
long long fastexp(long long a, long long b) {
  long long res = 1LL;
  while (b) {
    if (b & 1) res = res * a;
    b >>= 1;
    a *= a;
  }
  return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtendido(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int modInverso(int a, int m) {
  int x, y;
  int g = gcdExtendido(a, m, &x, &y);
  if (g != 1)
    return -1;
  else
    return (x % m + m) % m;
}
const int N = 200000 + 5;
const int M = 1000000 + 5;
const int bucket = 400;
int n, q;
int a[N];
long long ans[N];
int frec[M];
vector<pair<int, pair<int, int> > > queries;
bool comp(pair<int, pair<int, int> > a, pair<int, pair<int, int> > b) {
  int b1 = a.second.first / bucket;
  int b2 = b.second.first / bucket;
  if (b1 != b2) return b1 < b2;
  return a.second.second < b.second.second;
}
int main() {
  scanf("%d %d", &(n), &(q));
  for (int i = 1; i <= n; i++) {
    scanf("%d", &(a[i]));
  }
  int l, r;
  for (int i = 0; i < q; i++) {
    scanf("%d %d", &(l), &(r));
    queries.push_back(make_pair(i, make_pair(l, r)));
  }
  sort((queries).begin(), (queries).end(), comp);
  l = 1;
  r = 0;
  long long act = 0LL;
  for (int i = 0; i < q; i++) {
    int L = queries[i].second.first;
    int R = queries[i].second.second;
    int pos = queries[i].first;
    while (l > L) {
      l--;
      act += 2LL * frec[a[l]] * a[l] + a[l];
      frec[a[l]]++;
    }
    while (r < R) {
      r++;
      act += 2LL * frec[a[r]] * a[r] + a[r];
      frec[a[r]]++;
    }
    while (l < L) {
      act -= 2LL * frec[a[l]] * a[l] - a[l];
      frec[a[l]]--;
      l++;
    }
    while (r > R) {
      act -= 2LL * frec[a[r]] * a[r] - a[r];
      frec[a[r]]--;
      r--;
    }
    ans[pos] = act;
  }
  for (int i = 0; i < q; i++) {
    printf("%lld\n", ans[i]);
  }
  return 0;
}
