#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

void solve() {

	ll n, q;
	cin >> n >> q;

	vector<ll> v(n+1, 0);

	vector<set<ll>> up(501);
	vector<set<ll>> down(501);
	for(ll i = 1; i <= n; i++) {
		ll h;
		cin >> h;
		up[h].insert(i);
		down[h].insert(i);
		v[i] = h;
	}

	for(ll i = 499; i >= 1; i--) {
		up[i].insert(up[i+1].begin(), up[i+1].end());
	}
	for(ll i = 2; i <= 500; i++) {
		down[i].insert(down[i-1].begin(), down[i-1].end());
	}

	for(ll qi = 0; qi < q; qi++) {

		ll mxbuy, mnsell;
		cin >> mxbuy >> mnsell;

		ll ans = 0;

		ll curr = 0;
		bool h = false;

		while(curr <= n) {

			if(curr == 0) {
				curr = *down[mxbuy].begin();
				h = true;
				ans -= v[curr];
				continue;
			}

			if(h) {
				// has it, wants to sell
				// searches for first moment where prices is mnsell or more

				if(curr > *up[mnsell].rbegin())
				{
					// can't sell any more
					curr = n+1;
					break;
				}else{

					curr = *up[mnsell].upper_bound(curr);
					h = false;
					ans += v[curr];
				}
			}else{
				// doesn't have, wants to buy

				// searches for first moment where prices is mxbuy or less
				if(curr > *down[mxbuy].rbegin()) {
					// no moment where he can buy another, it's joever
					curr = n+1;
					break;
				}else{
					curr = *down[mxbuy].upper_bound(curr);
					h = true;
					ans -= v[curr];
				}
			}
		}

		cout << ans << "\n";
	}
}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}