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>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
using namespace std;
template <typename T>
istream &operator>>(istream &in, vector<T> &arr) {
  for (auto &x : arr) in >> x;
  return in;
}
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &arr) {
  for (auto &x : arr) out << x << ' ';
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, const set<T> &arr) {
  for (auto &x : arr) out << x << ' ';
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, const multiset<T> &arr) {
  for (auto &x : arr) out << x << ' ';
  return out;
}
template <typename T, typename D>
istream &operator>>(istream &in, pair<T, D> &p) {
  in >> p.first >> p.second;
  return in;
}
template <typename T, typename D>
ostream &operator<<(ostream &out, const pair<T, D> &p) {
  out << p.first << ' ' << p.second;
  return out;
}
template <typename T, typename D>
istream &operator>>(istream &in, vector<pair<T, D> > &arr) {
  for (auto &[x, y] : arr) in >> x >> y;
  return in;
}
template <typename T, typename D>
ostream &operator<<(ostream &out, const vector<pair<T, D> > &arr) {
  for (auto &[x, y] : arr) out << x << ' ' << y << '\n';
  return out;
}
void IO() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const long long INF = 1e18;
const int int_INF = 1e9 + 13;
const long double PI = acos(-1);
const long double EPS = 1e-9;
const long long MOD = 1e9 + 7;
const int int_MOD = 1e9 + 7;
const long long MAXN = 2e5 + 13;
int sz;
bool cmp(const tuple<int, int, int> &a, const tuple<int, int, int> &b) {
  auto &[a1, a2, a3] = a;
  auto &[b1, b2, b3] = b;
  int x = a1 / sz, y = b1 / sz;
  if (x == y)
    return a2 < b2;
  else
    return x < y;
}
void solve() {
  int n, m, qnum = 0;
  cin >> n >> m;
  sz = sqrt(n << 1);
  vector<long long> arr(n), ans(m);
  vector<int> cnt(1000001, 0);
  cin >> arr;
  vector<tuple<int, int, int> > queries(m);
  for (auto &[l, r, i] : queries) {
    cin >> l >> r;
    --l;
    --r;
    i = qnum++;
  }
  sort(queries.begin(), queries.end(), cmp);
  auto &[uuu, iii, ooo] = queries[0];
  int left, right;
  left = right = uuu;
  ++cnt[arr[left]];
  long long res = arr[left];
  for (auto &[l, r, i] : queries) {
    while (left < l) {
      long long cur = cnt[arr[left]];
      --cnt[arr[left]];
      res -= cur * cur * arr[left];
      --cur;
      res += 1LL * cur * cur * arr[left];
      ++left;
    }
    while (right > r) {
      long long cur = cnt[arr[right]];
      --cnt[arr[right]];
      res -= 1LL * cur * cur * arr[right];
      --cur;
      res += 1LL * cur * cur * arr[right];
      --right;
    }
    while (left > l) {
      --left;
      long long cur = cnt[arr[left]];
      ++cnt[arr[left]];
      res -= 1LL * cur * cur * arr[left];
      ++cur;
      res += 1LL * cur * cur * arr[left];
    }
    while (right < r) {
      ++right;
      long long cur = cnt[arr[right]];
      ++cnt[arr[right]];
      res -= 1LL * cur * cur * arr[right];
      ++cur;
      res += 1LL * cur * cur * arr[right];
    }
    ans[i] = res;
  }
  for (long long &x : ans) cout << x << '\n';
  cout << '\n';
}
signed main() {
  IO();
  solve();
  return 0;
}
