#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const long long LLINF = 1LL << 62;
const int mod = 1000000007;
int buffer = 1 << 13;
int cnt = buffer - 1;
char buff[10005];
char gchar() {
  if (++cnt == buffer) {
    cnt = 0;
    fread(buff, buffer, 1, stdin);
  }
  return buff[cnt];
}
int gint() {
  int x = 0;
  char c = gchar();
  while (c < '0' || '9' < c) c = gchar();
  while ('0' <= c && c <= '9') {
    x = x * 10 + c - '0';
    c = gchar();
  }
  return x;
}
int n, m, k, i, j, block, lstblock, rgt, lgt;
int v[200005], values[200005], f[1000005], ltlf[1000005];
long long sol, partsol, res[200005];
pair<pair<int, int>, int> q[200005];
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / lgt == b.first.first / lgt)
    return a.first.second < b.first.second;
  return (a.first.first / lgt) < (b.first.first / lgt);
}
int main() {
  n = gint();
  m = gint();
  for (i = 0; i < n; i++) {
    v[i] = gint();
    f[v[i]]++;
    if (f[v[i]] == 1) values[++k] = v[i];
  }
  for (i = 1; i <= m; i++) {
    q[i].first.first = gint() - 1;
    q[i].first.second = gint() - 1;
    q[i].second = i;
  }
  for (lgt = 1; lgt * lgt <= n; lgt++)
    ;
  lgt--;
  if (!lgt) lgt = 1;
  sort(q + 1, q + m + 1, cmp);
  lstblock = -1;
  for (i = 1; i <= m; i++) {
    if (q[i].first.second / lgt == q[i].first.first / lgt) {
      partsol = 0;
      for (j = q[i].first.first; j <= q[i].first.second; j++) {
        ltlf[v[j]]++;
        partsol += 1LL * (ltlf[v[j]] * 2 - 1) * v[j];
      }
      res[q[i].second] = partsol;
      for (j = q[i].first.first; j <= q[i].first.second; j++) ltlf[v[j]]--;
      continue;
    }
    block = q[i].first.first / lgt;
    if (block != lstblock) {
      for (j = 1; j <= k; j++) f[values[j]] = 0;
      sol = 0;
      rgt = (block + 1) * lgt - 1;
    }
    for (j = rgt + 1; j <= q[i].first.second; j++) {
      f[v[j]]++;
      sol += 1LL * (2 * f[v[j]] - 1) * v[j];
    }
    rgt = q[i].first.second;
    partsol = sol;
    for (j = q[i].first.first; j < (block + 1) * lgt; j++) {
      f[v[j]]++;
      partsol += 1LL * (2 * f[v[j]] - 1) * v[j];
    }
    res[q[i].second] = partsol;
    for (j = q[i].first.first; j < (block + 1) * lgt; j++) f[v[j]]--;
    lstblock = block;
  }
  for (i = 1; i <= m; i++) printf("%I64d\n", res[i]);
  return 0;
}
