#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <climits>
using namespace std;

typedef long long ll;
const ll INF = LLONG_MAX;
ll k;

struct Q {
    ll l, r, ind;
};

int main() {
    ll n, m;
    cin >> n >> m;
    k = sqrt(n) + 1;
    vector <ll> arr(n);
    for (ll i = 0; i < n; i++) {
        cin >> arr[i];
    }
    vector <Q> q;
    vector <ll> cur(1000000 + 1);
    for (ll i = 0; i < m; i++) {
        ll l, r;
        cin >> l >> r;
        l--, r--;
        Q tmp;
        tmp.l = l;
        tmp.r = r;
        tmp.ind = i;
        q.push_back(tmp);
    }
    sort(q.begin(), q.end(), [](Q a, Q b) {
        if (a.l / k != b.l / k) {
            return (a.l / k) < (b.l / k);
        }
        return a.r < b.r;
    });
    vector <ll> answer(m);
    ll l, r, sum = 0;
    for (ll i = q[0].l; i <= q[0].r; i++) {
        sum -= cur[arr[i]] * cur[arr[i]] * arr[i];
        cur[arr[i]]++;
        sum += cur[arr[i]] * cur[arr[i]] * arr[i];
    }
    answer[q[0].ind] = sum;
    l = q[0].l;
    r = q[0].r;
    for (ll i = 1; i < m; i++) {
        if (r < q[i].r) {
            for (ll j = r + 1; j <= q[i].r; j++) {
                sum -= cur[arr[j]] * cur[arr[j]] * arr[j];
                cur[arr[j]]++;
                sum += cur[arr[j]] * cur[arr[j]] * arr[j];
            }
        }
        if (l < q[i].l) {
            for (ll j = l; j < q[i].l; j++) {
                sum -= cur[arr[j]] * cur[arr[j]] * arr[j];
                cur[arr[j]]--;
                sum += cur[arr[j]] * cur[arr[j]] * arr[j];
            }
        }
        if (l > q[i].l) {
            for (ll j = l - 1; j >= q[i].l; j--) {
                sum -= cur[arr[j]] * cur[arr[j]] * arr[j];
                cur[arr[j]]++;
                sum += cur[arr[j]] * cur[arr[j]] * arr[j];
            }
        }
        if (r > q[i].r) {
            for (ll j = r; j > q[i].r; j--) {
                sum -= cur[arr[j]] * cur[arr[j]] * arr[j];
                cur[arr[j]]--;
                sum += cur[arr[j]] * cur[arr[j]] * arr[j];
            }
        }
        l = q[i].l;
        r = q[i].r;
        answer[q[i].ind] = sum;
    }
    for (auto now : answer)  cout << now << endl;
    return 0;
}