9 10
6 2 3 1 4 8 5 9 8
3 9
6 6
9 9
9 9
9 9
2 3
3 9
3 8
6 9
5 6
 10 10
5 10 9 2 9 3 5 5 6 5
5 10
2 2
3 10
4 8
1 3
1 5
5 5
10 10
8 9
6 10
 8 10
100 100 100 100 100 100 100 100
1 8
2 8
3 8
4 8
5 8
6 8
7 8
8 8
1 1
1 5
 5 15
103 45 103 67 45
1 1
1 2
1 3
1 4
1 5
2 2
2 3
2 4
2 5
3 3
3 4
3 5
4 4
4 5
5 5
 1 1
1000000
1 1
 10 5
10 9 8 7 6 5 4 3 2 1
4 8
1 10
3 9
2 2
5 10
 9 10
5 3 10 2 4 8 7 5 1
6 9
1 8
3 3
2 7
3 5
4 6
9 9
8 8
1 9
5 6
 9 10
10 2 6 2 4 6 6 4 1
4 8
8 9
2 3
8 9
9 9
4 5
1 7
6 6
6 8
1 1
 20 8
1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2
4 15
1 2
2 20
7 7
13 18
7 7
3 19
3 8
 1 2
1
1 1
1 1
 8 10
5 7 3 1 4 2 1 1
5 7
3 8
2 7
4 8
4 5
2 8
4 6
1 2
4 7
3 5

54
8
8
8
8
5
54
30
46
12
 63
10
92
34
24
53
9
5
11
54
 6400
4900
3600
2500
1600
900
400
100
100
2500
 103
148
457
524
659
45
148
215
350
103
170
215
67
112
45
 1000000
 25
55
35
9
21
 21
54
10
34
16
14
1
5
55
12
 42
5
8
5
1
6
76
6
28
10
 108
3
281
1
27
1
209
27
 1
1
 7
18
20
15
5
25
7
12
10
8

#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;
}
