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 double eps = 1e-9;
int Unset(int a, int i) {
  int mask;
  mask = 1 << i;
  a = a & ~mask;
  return a;
}
template <class T>
inline T gcd(T a, T b) {
  return (b) == 0 ? (a) : gcd((b), ((a) % (b)));
}
template <class T>
inline T lcm(T a, T b) {
  return ((a) / gcd((a), (b)) * (b));
}
template <typename T>
string NumberToString(T Number) {
  ostringstream second;
  second << Number;
  return second.str();
}
int power(int x, int n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0) {
    int y = power(x, n / 2);
    return y * y;
  } else
    return x * power(x, n - 1);
}
struct debugger {
  template <typename T>
  debugger& operator,(const T& v) {
    cerr << v << " ";
    return *this;
  }
} dbg;
int n, arr[200010], lim, freq[1000010];
struct data {
  int x, y, z;
};
bool cmp(data a, data b) {
  if (a.x / lim == b.x / lim) {
    return a.y < b.y;
  }
  return a.x / lim < b.x / lim;
}
data v1[200010];
long long sqr[1000010], ans[200010];
void pre() {
  memset((sqr), 0, sizeof(sqr));
  for (int A = 0; A < 1000010; A++) {
    sqr[A] = (long long)A * (long long)A;
  }
}
int main() {
  pre();
  int qu;
  scanf("%d %d", &n, &qu);
  memset((freq), 0, sizeof(freq));
  for (int A = 0; A < n; A++) {
    scanf("%d", &arr[A]);
  }
  lim = ceil(sqrt(n));
  data dd1;
  for (int A = 0; A < qu; A++) {
    int x, y;
    scanf("%d %d", &x, &y);
    x--;
    y--;
    dd1.x = x;
    dd1.y = y;
    dd1.z = A;
    v1[A] = dd1;
  }
  sort(v1, v1 + qu, cmp);
  int s = 0, e = 0;
  long long total = 0;
  freq[arr[0]]++;
  total = arr[0];
  for (int A = 0; A < qu; A++) {
    while (e < v1[A].y) {
      e++;
      freq[arr[e]]++;
      total +=
          ((sqr[freq[arr[e]]] - sqr[freq[arr[e]] - 1]) * (long long)arr[e]);
    }
    while (e > v1[A].y) {
      freq[arr[e]]--;
      total -=
          ((sqr[freq[arr[e]] + 1] - sqr[freq[arr[e]]]) * (long long)arr[e]);
      e--;
    }
    while (s < v1[A].x) {
      freq[arr[s]]--;
      total -=
          ((sqr[freq[arr[s]] + 1] - sqr[freq[arr[s]]]) * (long long)arr[s]);
      s++;
    }
    while (s > v1[A].x) {
      s--;
      freq[arr[s]]++;
      total +=
          ((sqr[freq[arr[s]]] - sqr[freq[arr[s]] - 1]) * (long long)arr[s]);
    }
    ans[v1[A].z] = total;
  }
  for (int A = 0; A < qu; A++) {
    printf("%lld\n", ans[A]);
  }
  return 0;
}
