#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);
	for(ll &i : p)
		cin >> i;
	vector<pll> qr(q);
	for(auto &i : qr)
		cin >> i.fs >> i.sc;
	
	for(auto i : qr)
	{
		ll ans = 0;
		ll index = 0;
		while(index < n)
		{
			while(index < n && p[index] > i.fs)
				index++;
			if(index != n && p[index] <= i.fs)
			{
				ans -= p[index];
				index++;
				while(index < n && p[index] < i.sc)
					index++;
				if(index != n && p[index] >= i.sc)
				{
					ans += p[index];
					index++;
				}
			}
		}
		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;
}