#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
const int sqr2 = 0;
int elm_cnt[300'003];
ll oc_cnt[300'003];
unordered_set<int> non_zero;
int n,q;
int arr[300'001];
ll sqr_sum[300'001][sqr2+1];
void change_num(int x, int p)
{
oc_cnt[elm_cnt[x]]--;
if(oc_cnt[elm_cnt[x]] == 0) non_zero.erase(non_zero.find(elm_cnt[x]));
elm_cnt[x]+=p;
oc_cnt[elm_cnt[x]]++;
if(oc_cnt[elm_cnt[x]] == 1) non_zero.insert(elm_cnt[x]);
}
vl oc;
ll f(ll n, ll it, ll pref, ll ile)
{
if(ile == 0) return 0;
return (pref - it >= 0 ? -sqr_sum[pref-it][it] : 0) + sqr_sum[pref+(ile-1)*it][it] + (n-it) * (ile*pref + it * ((ile * (ile-1))/2));
}
ll get_ans(int n2)
{
oc = {};
forall(it,non_zero) oc.pb(it);
sort(all(oc));
ll ans = 0;
ll pref = 0;
ll suf = 0;
forall(it,oc)
{
ans += oc_cnt[it] * (it * (n2-it) + (it * (it-1)) / 2 + it);
if(it <= sqr2)
{
if(pref > suf) swap(pref,suf);
ll ile = min(oc_cnt[it],(suf-pref+it-1)/it);
ans += f(n2,it,pref,ile+(oc_cnt[it]-ile)/2);
pref += ((oc_cnt[it]-ile)/2+ile)*it;
ans += f(n2,it,suf,(oc_cnt[it]-ile+1)/2);
suf += (oc_cnt[it]-ile+1)/2 * it;
}
else
{
rep(k,oc_cnt[it])
{
if(pref < suf)
{
ans += pref * (n2-pref-it);
pref += it;
}
else
{
ans += suf * (n2-suf-it);
suf += it;
}
}
}
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
cin >> n >> q;
rep(i,n)
{
cin >> arr[i];
}
rep2(i,1,300'000)
{
rep2(d,1,sqr2)
{
sqr_sum[i][d] = -i*i + (i-d >= 0 ? sqr_sum[i-d][d] : 0);
}
}
// cout << sqr_sum[300'000][1] << " sqr\n";
oc_cnt[0] = 10000000;
rep(i,q)
{
int l,r;
cin >> l >> r;
l--;
r--;
rep2(k,l,r) change_num(arr[k],1);
cout << get_ans(r-l+1) << "\n";
rep2(k,l,r) change_num(arr[k],-1);
}
}
