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;
const long oo = 10000000;
const long MaxArray = 210700;
struct mang {
  long l, r, vt, ss;
};
long n, t, seg;
mang b[MaxArray];
long long ans[MaxArray];
long long a[MaxArray];
long long countt[oo];
bool func(mang a, mang b) {
  if (a.ss == b.ss) return a.r < b.r;
  return a.l < b.l;
}
long long get(long i, long long val, long long ans) {
  ans += (2 * val * countt[a[i]] + 1) * a[i];
  countt[a[i]] += val;
  return ans;
}
long long sum(mang x, mang y, long long ans) {
  if (x.l < y.l) {
    for (long i = x.l; i < y.l; i++) {
      ans = get(i, -1, ans);
    }
  } else if (x.l > y.l) {
    for (long i = x.l - 1; i >= y.l; i--) {
      ans = get(i, 1, ans);
    }
  }
  if (x.r > y.r) {
    for (long i = x.r; i > y.r; i--) {
      ans = get(i, -1, ans);
    }
  } else if (x.r < y.r) {
    for (long i = x.r + 1; i <= y.r; i++) {
      ans = get(i, 1, ans);
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> t;
  seg = sqrt(n);
  for (long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long i = 0; i < t; i++) {
    cin >> b[i].l >> b[i].r;
    b[i].ss = b[i].l / seg;
    b[i].vt = i;
  }
  sort(b, b + t, func);
  ans[b[0].vt] = 0;
  for (long i = b[0].l; i <= b[0].r; i++) {
    ans[b[0].vt] += (2 * countt[a[i]] + 1) * a[i];
    countt[a[i]]++;
  }
  for (long i = 1; i < t; i++) {
    ans[b[i].vt] = sum(b[i - 1], b[i], ans[b[i - 1].vt]);
  }
  for (long i = 0; i < t; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
