#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define fs first
#define sc second

struct s
{
	ll a, b, i;
};

ll n, m;
vll v, buy, sell, ans;
vector<pll> q, q2;
vector<bool> b;

int main() {
	cin >> n >> m;
	v.resize(n);
	q.resize(m);
	q2.resize(m);
	b.resize(m);
	ans.resize(m);
	buy.resize(m);
	sell.resize(m);
	for (ll i = 0; i <n; i++) cin >> v[i];
	for (ll i = 0; i < m; i++)
	{
		cin >> q[i].fs >> q2[i].fs;
		q[i].sc = i;
		q2[i].sc = i;
	}
	sort(q.rbegin(), q.rend());
	sort(q2.begin(), q2.end());
	/* for (ll i = 0; i < m; i++)
	{
		cout << q[i].fs << " " << q2[i].fs << endl;
	} */
	for (ll i = 0; i < n; i++)
	{
		for (ll j = 0; j < m; j++)
		{
			if (v[i] > q[j].fs)
			{
				break;
			}
			if (v[i] <= q[j].fs && b[q[j].sc] == 0)
			{
				b[q[j].sc] = 1;
				ans[q[j].sc] -= v[i];
				buy[j] += v[i];
			}
		}
		for (ll j = 0; j < m; j++)
		{
			if (v[i] < q2[j].fs)
			{
				break;
			}
			if (v[i] >= q[j].fs && b[q2[j].sc] == 1)
			{
				b[q2[j].sc] = 0;
				ans[q2[j].sc] += v[i];
				sell[j] += v[i];
			}
		}
	}
	/* for (ll i = 0; i < m; i ++)
	{
		cout << sell[i] << endl;
	}
	for (ll i = 0; i < m; i++)
	{
		ans[q[i].sc] -= buy[i];
		ans[q2[i].sc] += sell[i];
	} */
	for (ll i : ans) cout << i << endl;
}