#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl "\n"
#define pll pair<ll,ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define fs first
#define sc second

const ll MOD = 1e9+7;

void solve()
{
	ll n, q;
	cin >> n >> q;
	vector<ll> p(n);
	
	map<ll, vll> lw, bg;

	for(ll i = 0; i < n; i++)
	{
		cin >> p[i];
		for(ll j = p[i]; j <= 500; j++)
			lw[j].push_back(i);
		for(ll j = 0; j <= p[i]; j++)
			bg[j].push_back(i);
	}

	vector<pll> qr(q);
	for(auto &i : qr)
		cin >> i.fs >> i.sc;
	
	for(auto i : qr)
	{
		ll ans = 0;
		ll i1 = 0, i2 = 0;

		while(true)
		{
			ans -= p[lw[i.fs][i1]];
			i1++;
			while(i2 < bg[i.sc].size() && lw[i.fs][i1-1] >= bg[i.sc][i2])
				i2++;
			if(i2 == bg[i.sc].size())
				break;
			ans += p[bg[i.sc][i2]];
			i2++;
			while(i1 < lw[i.fs].size() && lw[i.fs][i1] <= bg[i.sc][i2-1])
				i1++;
			if(i1 == lw[i.fs].size())
				break;
		}
		
		cout << ans << "\n";
	}
	cout << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    ll t = 1;
    //cin >> t;
    while(t--)
        solve();
    return 0;
}