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>
template <typename T>
struct query {
  int l;
  int r;
  int idx;
  int tot;
  T res;
  query(int left, int right, int index, int total)
      : l(left), r(right), idx(index), tot(total) {
    res = 0;
  }
};
template <typename T>
bool sort_fun(query<T> &i, query<T> &j) {
  int bi = (int)(i.l / (int)std::sqrt(i.tot));
  int bj = (int)(j.l / (int)std::sqrt(j.tot));
  if (bi == bj) {
    return i.r < j.r;
  } else {
    return bi < bj;
  }
}
template <typename T>
bool sort_fun1(query<T> &i, query<T> &j) {
  return i.idx < j.idx;
}
template <typename T, typename S>
void solve(std::vector<T> const &a, std::vector<query<S>> &q,
           std::vector<S> const &values, int s, int e) {
  int curri = q[s].l;
  int currj = q[s].l - 1;
  std::vector<S> occ(a.size(), 0);
  int64_t answer = 0;
  for (int i = s; i < e; ++i) {
    while (curri < q[i].l) {
      answer -= occ[a[curri]] * occ[a[curri]] * values[a[curri]];
      occ[a[curri]]--;
      answer += occ[a[curri]] * occ[a[curri]] * values[a[curri]];
      curri++;
    }
    while (curri > q[i].l) {
      --curri;
      answer -= occ[a[curri]] * occ[a[curri]] * values[a[curri]];
      occ[a[curri]]++;
      answer += occ[a[curri]] * occ[a[curri]] * values[a[curri]];
    }
    while (currj < q[i].r) {
      ++currj;
      answer -= occ[a[currj]] * occ[a[currj]] * values[a[currj]];
      occ[a[currj]]++;
      answer += occ[a[currj]] * occ[a[currj]] * values[a[currj]];
    }
    while (currj > q[i].r) {
      answer -= occ[a[currj]] * occ[a[currj]] * values[a[currj]];
      occ[a[currj]]--;
      answer += occ[a[currj]] * occ[a[currj]] * values[a[currj]];
      --currj;
    }
    q[i].res = answer;
  }
}
template <typename T, typename S>
void powarray_moalgo(std::vector<T> const &a, std::vector<query<S>> &q,
                     std::vector<S> const &values) {
  std::sort(q.begin(), q.end(), sort_fun<S>);
  int start = 0;
  int end = 0;
  int idx = 0;
  while (end < q.size()) {
    idx += (int)sqrt(a.size());
    while (q[end].l < idx && end < q.size()) {
      end++;
    }
    solve(a, q, values, start, end);
    start = end;
  }
  std::sort(q.begin(), q.end(), sort_fun1<S>);
}
int main() {
  std::ios_base::sync_with_stdio(false);
  int n, q;
  std::cin >> n >> q;
  std::vector<int64_t> array;
  std::vector<int64_t> remap;
  std::vector<int> pos;
  std::vector<query<int64_t>> queries;
  array.reserve(n);
  remap.reserve(n);
  pos.reserve(n);
  for (int i = 0; i < n; ++i) {
    int64_t tmp;
    std::cin >> tmp;
    array.push_back(tmp);
    remap.push_back(tmp);
  }
  std::sort(remap.begin(), remap.end());
  for (int i = 0; i < n; ++i) {
    auto pp = std::lower_bound(remap.begin(), remap.end(), array[i]);
    int p = (pp - remap.begin());
    pos.push_back(p);
  }
  for (int i = 0; i < q; ++i) {
    int tmpl, tmpr;
    std::cin >> tmpl >> tmpr;
    queries.push_back(query<int64_t>(tmpl - 1, tmpr - 1, i, n));
  }
  powarray_moalgo(pos, queries, remap);
  for (auto &q : queries) {
    std::cout << q.res << std::endl;
  }
}
