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

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    cin >> n >> q;
    vector<int> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i];
    }
    vector<int> mi(n, -1), ma(n, -1);
    stack<pair<int, int>> minst;
    for (int i = n - 1; i >= 0; i--)
    {
        if (!minst.empty())
            mi[i] = minst.top().second;
        while (!minst.empty() && minst.top().first >= v[i])
        {
            minst.pop();
        }
        minst.push({v[i], i});
    }
    stack<pair<int, int>> maxt;
    for (int i = n - 1; i >= 0; i--)
    {
        if (!maxt.empty())
            ma[i] = maxt.top().second;
        while (!maxt.empty() && maxt.top().first <= v[i])
        {
            maxt.pop();
        }
        maxt.push({v[i], i});
    }
    for (int i = 0; i < q; i++)
    {
        int a, b;
        cin >> a >> b;
        int win = 0;
        int cur = 0;
        bool own = false;
        while (cur != -1 && cur < n)
        {
            if (!own)
            {
                while (cur != -1 && v[cur] > a)
                    cur = mi[cur];
                if (v[cur] <= a)
                {
                    win -= v[cur];
                    own = true;
                    cur++;
                }
            }
            else
            {
                while (cur != -1 && v[cur] < b)
                    cur = ma[cur];
                if (v[cur] >= b)
                {
                    win += v[cur];
                    own = false;
                    cur++;
                }
            }
        }
        cout << win << "\n";
    }
}