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>
#pragma GCC optimize("O3")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long double PI = acos(-1);
const long long MOD = 1000000007;
const long long FMOD = 998244353;
const long double eps = 1e-9;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
void solve();
signed main() {
  cout << fixed << setprecision(10);
  long long t = 1;
  for (long long testcase = 1; testcase < t + 1; testcase++) {
    solve();
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
const long long MAXN = 1e6 + 10;
long long n, m, blk_sz, freq[MAXN], curans;
vector<long long> arr, ans;
vector<pair<pair<long long, long long>, long long> > queries;
bool cmp(pair<pair<long long, long long>, long long> a,
         pair<pair<long long, long long>, long long> b) {
  if (a.first.first / blk_sz == b.first.first / blk_sz)
    return a.first.second < b.first.second;
  return a.first.first / blk_sz < b.first.first / blk_sz;
}
void add(long long x) {
  curans -= freq[x] * freq[x] * x;
  freq[x]++;
  curans += freq[x] * freq[x] * x;
}
void remove(long long x) {
  curans -= freq[x] * freq[x] * x;
  freq[x]--;
  curans += freq[x] * freq[x] * x;
}
void solve() {
  scanf("%lld%lld", &n, &m);
  blk_sz = sqrt(n) + 1;
  arr.resize(n + 1);
  ans.resize(m);
  queries.resize(m);
  memset(freq, 0, sizeof freq);
  curans = 0;
  for (long long i = 1; i <= n; i++) scanf("%lld", &arr[i]);
  for (long long i = 0; i < m; i++) {
    scanf("%lld%lld", &queries[i].first.first, &queries[i].first.second);
    queries[i].second = i;
  }
  sort(queries.begin(), queries.end(), cmp);
  long long l = 1, r = 1;
  for (long long i = 0; i < m; i++) {
    while (l < queries[i].first.first) remove(arr[l++]);
    while (l > queries[i].first.first) add(arr[--l]);
    while (r <= queries[i].first.second) add(arr[r++]);
    while (r > queries[i].first.second + 1) remove(arr[--r]);
    ans[queries[i].second] = curans;
  }
  for (auto u : ans) printf("%lld\n", u);
}
