#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void Int(T &a) {
  bool minus = false;
  a = 0;
  char ch = getchar();
  while (true) {
    if (ch == '-' or (ch >= '0' && ch <= '9')) break;
    ch = getchar();
  }
  if (ch == '-')
    minus = true;
  else
    a = ch - '0';
  while (true) {
    ch = getchar();
    if (ch < '0' || ch > '9') break;
    a = a * 10 + (ch - '0');
  }
  if (minus) a *= -1;
}
template <typename T>
inline void Int(T &a, T &b) {
  Int(a), Int(b);
}
template <typename T>
inline void Int(T &a, T &b, T &c) {
  Int(a, b), Int(c);
}
template <typename T>
inline void Int(T &a, T &b, T &c, T &d) {
  Int(a, b), Int(c, d);
}
void err(istream_iterator<string> it) { cout << endl; }
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << ' ';
  err(++it, args...);
}
const int N = (int)1e5 + 5;
const int maxN = (int)1e6 + 6;
const long long Mod = (long long)1e9 + 7;
const int inf = (int)2e9;
const long long Inf = (long long)1e18;
const int mod = (int)1e9 + 7;
inline int add(int a, int b, int mod) {
  a += b;
  return a >= mod ? a - mod : a;
}
inline int sub(int a, int b, int mod) {
  a -= b;
  return a < 0 ? a + mod : a;
}
inline int mul(int a, int b, int mod) { return (long long)a * b % mod; }
const int block = 450;
struct Q {
  int l, r, id;
  Q() : l(0), r(0), id(0) {}
  Q(int l, int r, int id) : l(l), r(r), id(id) {}
  bool operator<(const Q &p) const {
    if (l / block != p.l / block)
      return make_pair(l / block, r) < make_pair(p.l / block, p.r);
    return ((l / block) & 1) ? r < p.r : r > p.r;
  }
};
int n, c, q, cnt[maxN];
long long res;
void remove(int x) {
  res -= (1LL * cnt[x] * cnt[x] * x);
  cnt[x]--;
  res += (1LL * cnt[x] * cnt[x] * x);
}
void insert(int x) {
  res -= (1LL * cnt[x] * cnt[x] * x);
  cnt[x]++;
  res += (1LL * cnt[x] * cnt[x] * x);
}
int main() {
  int test = 1, tc = 0;
  while (test--) {
    Int(n, q);
    vector<int> a(n + 1);
    vector<Q> query;
    for (int i = 1; i <= n; ++i) Int(a[i]);
    for (int i = 1; i <= q; ++i) {
      int l, r;
      Int(l, r);
      query.push_back(Q(l, r, i));
    }
    sort(query.begin(), query.end());
    vector<long long> ans(q + 1);
    int l = 1, r = 0;
    res = 0;
    for (Q i : query) {
      while (l > i.l) insert(a[--l]);
      while (r < i.r) insert(a[++r]);
      while (l < i.l) remove(a[l++]);
      while (r > i.r) remove(a[r--]);
      ans[i.id] = res;
    }
    for (int i = 1; i <= q; ++i) {
      printf("%lld\n", ans[i]);
    }
  }
  return 0;
}
