#include <bits/stdc++.h>
using namespace std;
long long n, q, v[200001], sq, freq[1000001], ans, ansi[200001];
vector<pair<long long, pair<long long, long long>>> qs;
bool cmp(pair<long long, pair<long long, long long>> a,
         pair<long long, pair<long long, long long>> b) {
  if (a.first / sq != b.first / sq) {
    if (a.first < b.first) {
      return true;
    }
    return false;
  } else {
    if (a.second < b.second) {
      return true;
    }
    return false;
  }
}
void del(long long val) {
  if (freq[val] > 0) {
    ans -= val * freq[val] * freq[val];
  }
  freq[val] -= 1;
  ans += val * freq[val] * freq[val];
}
void add(long long val) {
  if (freq[val] > 0) {
    ans -= val * freq[val] * freq[val];
  }
  freq[val] += 1;
  ans += val * freq[val] * freq[val];
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(NULL);
  cin.tie(NULL);
  cin >> n >> q;
  sq = sqrt(n);
  for (long long i = 1; i <= n; i += 1) {
    cin >> v[i];
  }
  for (long long i = 0; i < q; i += 1) {
    long long a, b;
    cin >> a >> b;
    qs.push_back({a, {b, i}});
  }
  sort(qs.begin(), qs.end(), cmp);
  long long p1 = 1, p2 = 1;
  for (pair<long long, pair<long long, long long>> i : qs) {
    while (p2 <= i.second.first) {
      add(v[p2]);
      p2 += 1;
    }
    while (p2 > i.second.first + 1) {
      p2 -= 1;
      del(v[p2]);
    }
    while (p1 < i.first) {
      del(v[p1]);
      p1 += 1;
    }
    while (p1 > i.first) {
      p1 -= 1;
      add(v[p1]);
    }
    ansi[i.second.second] = ans;
  }
  for (int i = 0; i < q; i += 1) {
    cout << ansi[i] << '\n';
  }
}
