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;
vector<int> mul(vector<int> const& a, vector<int> const& b) {
  vector<int> c;
  size_t k = 0, z = 0;
  while (k < a.size() && z < b.size()) {
    if (a[k] < b[z]) {
      c.push_back(a[k]);
      k++;
    } else {
      c.push_back(b[z]);
      z++;
    }
  }
  while (k < a.size()) {
    c.push_back(a[k]);
    k++;
  }
  while (z < b.size()) {
    c.push_back(b[z]);
    z++;
  }
  return c;
}
struct SegmentTree {
  SegmentTree(int n, const vector<vector<int>>& a) {
    v.resize(2 * n + 1, inf);
    build(1, 0, n - 1, a);
  }
  void build(int u, int l, int r, const vector<vector<int>>& a) {
    if (l == r) {
      if (r < (int)a.size()) v[u] = a[l];
      return;
    }
    int m = (l + r) / 2;
    build(u * 2, l, m, a);
    build(u * 2 + 1, m + 1, r, a);
    v[u] = mul(v[u * 2], v[u * 2 + 1]);
  }
  vector<int> get(int u, int L, int R, int l, int r) {
    if (L > r || R < l) return inf;
    if (L >= l && R <= r) {
      return v[u];
    }
    int m = (L + R) / 2;
    return mul(get(u * 2, L, m, l, r), get(u * 2 + 1, m + 1, R, l, r));
  }
  vector<int> inf;
  vector<vector<int>> v;
};
unsigned int a, b;
unsigned int cur = 0;
unsigned int nextRand17() {
  cur = cur * a + b;
  return cur >> 15;
}
unsigned int nextRand24() {
  cur = cur * a + b;
  return cur >> 8;
}
const int P = 450;
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  int la = a.first.first / P;
  int lb = b.first.first / P;
  if (lb != la) {
    return la < lb;
  }
  return a.first.second < b.first.second;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m;
  cin >> n >> m;
  vector<int> v(n);
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
  }
  vector<pair<pair<int, int>, int>> q;
  for (int i = 0; i < m; ++i) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    q.push_back(make_pair(make_pair(a, b), i));
  }
  sort(q.begin(), q.end(), cmp);
  vector<long long> ans(m);
  vector<int> tmp(1e6 + 10);
  int l = 0, r = 0;
  tmp[v[0]]++;
  long long sum = v[0];
  for (int i = 0; i < m; ++i) {
    int l1 = q[i].first.first;
    int r1 = q[i].first.second;
    if (r < r1) {
      for (; r < r1;) {
        r++;
        sum -= ((long long)tmp[v[r]] * tmp[v[r]] * (long long)v[r]);
        tmp[v[r]]++;
        sum += ((long long)tmp[v[r]] * tmp[v[r]] * (long long)v[r]);
      }
    } else {
      for (; r > r1;) {
        sum -= ((long long)tmp[v[r]] * tmp[v[r]] * (long long)v[r]);
        tmp[v[r]]--;
        sum += ((long long)tmp[v[r]] * tmp[v[r]] * (long long)v[r]);
        r--;
      }
    }
    if (l < l1) {
      for (; l < l1;) {
        sum -= ((long long)tmp[v[l]] * tmp[v[l]] * (long long)v[l]);
        tmp[v[l]]--;
        sum += ((long long)tmp[v[l]] * tmp[v[l]] * (long long)v[l]);
        l++;
      }
    } else {
      for (; l > l1;) {
        l--;
        sum -= ((long long)tmp[v[l]] * tmp[v[l]] * (long long)v[l]);
        tmp[v[l]]++;
        sum += ((long long)tmp[v[l]] * tmp[v[l]] * (long long)v[l]);
      }
    }
    ans[q[i].second] = sum;
  }
  for (size_t i = 0; i < ans.size(); ++i) {
    cout << ans[i] << "\n";
  }
  return 0;
}
