#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O2")
template <typename T>
void chkmax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
void chkmin(T &x, T y) {
  x = min(x, y);
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &p) {
  o << p.first << " " << p.second << "      ";
  return o;
}
template <class T>
ostream &operator<<(ostream &o, const vector<T> &v) {
  for (auto &i : v) {
    o << i << " ";
  }
  return o;
}
const int LIM = 2e5 + 5, MOD = 1e9 + 7;
long long n, m, t, x, y, l, r, s;
long long block, a[LIM], ans[LIM];
pair<pair<int, int>, int> q[LIM];
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / block != b.first.first / block) {
    return a.first.first / block < b.first.first / block;
  }
  return a.first.second < b.first.second;
}
int cnt[(int)1e6 + 5];
long long answer = 0;
void change(int index, int op) {
  if (op == 1) {
    s = cnt[a[index]]++;
    answer += (2 * s + 1) * a[index];
  } else {
    s = cnt[a[index]]--;
    answer -= (2 * s - 1) * a[index];
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> t;
  block = (int)sqrt(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < t; i++) {
    cin >> q[i].first.first >> q[i].first.second;
    q[i].first.first--;
    q[i].first.second--;
    q[i].second = i;
  }
  sort(q, q + t, cmp);
  x = 0, y = 0;
  for (int i = 0; i < t; i++) {
    l = q[i].first.first;
    r = q[i].first.second;
    while (x < l) {
      change(x, 0);
      x++;
    }
    while (x > l) {
      change(x - 1, 1);
      x--;
    }
    while (y <= r) {
      change(y, 1);
      y++;
    }
    while (y > r + 1) {
      change(y - 1, 0);
      y--;
    }
    ans[q[i].second] = answer;
  }
  for (int i = 0; i < t; i++) cout << ans[i] << "\n";
  return 0;
}
