#include <bits/stdc++.h>
using namespace std;
int n, m, bl, c[200005 * 5], a[200005];
long long ans, Ans[200005];
struct node {
  int l, r, id;
} p[200005];
inline bool cmp(node x, node y) {
  if (x.l / bl != y.l / bl) return x.l < y.l;
  if ((x.l / bl) & 1) return x.r > y.r;
  return x.r < y.r;
}
inline void add(int x) {
  x = a[x], ans -= 1ll * c[x] * c[x] * x, c[x]++, ans += 1ll * c[x] * c[x] * x;
}
inline void del(int x) {
  x = a[x], ans -= 1ll * c[x] * c[x] * x, c[x]--, ans += 1ll * c[x] * c[x] * x;
}
struct FastIO {
  static const int S = 1048576;
  char buf[S], *L, *R;
  int stk[20], Top;
  ~FastIO() { clear(); }
  inline char nc() {
    return L == R && (R = (L = buf) + fread(buf, 1, S, stdin), L == R) ? EOF
                                                                       : *L++;
  }
  inline void clear() {
    fwrite(buf, 1, Top, stdout);
    Top = 0;
  }
  inline void pc(char ch) {
    Top == S && (clear(), 0);
    buf[Top++] = ch;
  }
  inline void endl() { pc('\n'); }
  FastIO& operator>>(char& ch) {
    while (ch = nc(), ch == ' ' || ch == '\n')
      ;
    return *this;
  }
  template <typename T>
  FastIO& operator>>(T& ret) {
    ret = 0;
    int f = 1;
    char ch = nc();
    while (ch < '0' || ch > '9') {
      if (ch == '-') f = -f;
      ch = nc();
    }
    while (ch >= '0' && ch <= '9') {
      ret = ret * 10 + ch - '0';
      ch = nc();
    }
    ret *= f;
    return *this;
  }
  FastIO& operator>>(char* s) {
    int Len = 0;
    char ch = nc();
    while (ch != '\n') {
      *(s + Len) = ch;
      Len++;
      ch = nc();
    }
  }
  template <typename T>
  FastIO& operator<<(T x) {
    if (x < 0) {
      pc('-');
      x = -x;
    }
    do {
      stk[++stk[0]] = x % 10;
      x /= 10;
    } while (x);
    while (stk[0]) pc('0' + stk[stk[0]--]);
    return *this;
  }
  FastIO& operator<<(char ch) {
    pc(ch);
    return *this;
  }
  FastIO& operator<<(string str) {
    int Len = str.size() - 1;
    for (stk[0] = 0; Len >= 0; Len--) stk[++stk[0]] = str[Len];
    while (stk[0]) pc(stk[stk[0]--]);
    return *this;
  }
} fin, fout;
int main() {
  fin >> n >> m;
  for (register int i = 1; i <= n; i++) fin >> a[i];
  for (register int i = 1; i <= m; i++) fin >> p[i].l >> p[i].r, p[i].id = i;
  bl = (int)ceil(2.0 * n / sqrt(m)), sort(p + 1, p + m + 1, cmp);
  int L = 1, R = 0;
  for (register int i = 1; i <= m; i++) {
    int l = p[i].l, r = p[i].r;
    while (L > l) add(--L);
    while (R < r) add(++R);
    while (L < l) del(L++);
    while (R > r) del(R--);
    Ans[p[i].id] = ans;
  }
  for (register int i = 1; i <= m; i++) fout << Ans[i] << '\n';
  return 0;
}
