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>
int INP;
char BUF[1024 + 1], *inp = BUF;
using namespace std;
struct T {
  int l, r, d;
  T(int L = 0, int R = 0, int D = 0) : l(L), r(R), d(D) {}
};
inline bool cmp(const T& a, const T& b) {
  return a.l < b.l || a.l == b.l && a.r < b.r;
}
int a[222222], p[1111111], n, m, l, r;
long long S[222222], s;
vector<T> b[222222 / 500];
int main() {
  {
    {
      if (!*inp) {
        fread(BUF, 1, 1024, stdin);
        inp = BUF;
      }
      INP = *inp++;
    };
    while (!(((INP) >= '0') && ((INP) <= '9'))) {
      if (!*inp) {
        fread(BUF, 1, 1024, stdin);
        inp = BUF;
      }
      INP = *inp++;
    };
    n = INP - '0';
    {
      if (!*inp) {
        fread(BUF, 1, 1024, stdin);
        inp = BUF;
      }
      INP = *inp++;
    };
    while ((((INP) >= '0') && ((INP) <= '9'))) {
      n = n * 10 + (INP - '0');
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
    }
  };
  {
    {
      if (!*inp) {
        fread(BUF, 1, 1024, stdin);
        inp = BUF;
      }
      INP = *inp++;
    };
    while (!(((INP) >= '0') && ((INP) <= '9'))) {
      if (!*inp) {
        fread(BUF, 1, 1024, stdin);
        inp = BUF;
      }
      INP = *inp++;
    };
    m = INP - '0';
    {
      if (!*inp) {
        fread(BUF, 1, 1024, stdin);
        inp = BUF;
      }
      INP = *inp++;
    };
    while ((((INP) >= '0') && ((INP) <= '9'))) {
      m = m * 10 + (INP - '0');
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
    }
  };
  for (int i = 0, x; i < n; i++) {
    {
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      while (!(((INP) >= '0') && ((INP) <= '9'))) {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      x = INP - '0';
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      while ((((INP) >= '0') && ((INP) <= '9'))) {
        x = x * 10 + (INP - '0');
        {
          if (!*inp) {
            fread(BUF, 1, 1024, stdin);
            inp = BUF;
          }
          INP = *inp++;
        };
      }
    };
    a[i] = x;
  }
  for (int i = 0, x, y; i < m; i++) {
    {
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      while (!(((INP) >= '0') && ((INP) <= '9'))) {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      x = INP - '0';
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      while ((((INP) >= '0') && ((INP) <= '9'))) {
        x = x * 10 + (INP - '0');
        {
          if (!*inp) {
            fread(BUF, 1, 1024, stdin);
            inp = BUF;
          }
          INP = *inp++;
        };
      }
    };
    {
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      while (!(((INP) >= '0') && ((INP) <= '9'))) {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      y = INP - '0';
      {
        if (!*inp) {
          fread(BUF, 1, 1024, stdin);
          inp = BUF;
        }
        INP = *inp++;
      };
      while ((((INP) >= '0') && ((INP) <= '9'))) {
        y = y * 10 + (INP - '0');
        {
          if (!*inp) {
            fread(BUF, 1, 1024, stdin);
            inp = BUF;
          }
          INP = *inp++;
        };
      }
    };
    x--;
    b[(y - x) / 500].push_back(T(x, y, i));
  }
  for (int i = 0; i <= n / 500; i++)
    if (b[i].size()) {
      sort(b[i].begin(), b[i].end(), cmp);
      for (int j = 0; j < b[i].size(); j++) {
        T t = b[i][j];
        while (l > t.l)
          l--, s += (long long)(p[a[l]] * 2 + 1) * a[l], p[a[l]]++;
        while (l < t.l)
          p[a[l]]--, s -= (long long)(p[a[l]] * 2 + 1) * a[l], l++;
        while (r < t.r)
          s += (long long)(p[a[r]] * 2 + 1) * a[r], p[a[r]]++, r++;
        while (r > t.r)
          r--, p[a[r]]--, s -= (long long)(p[a[r]] * 2 + 1) * a[r];
        S[t.d] = s;
      }
    }
  for (int i = 0; i < m; i++) printf("%I64d\n", S[i]);
  return 0;
}
