#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
typedef long long LL;
typedef pair<int,int> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};



#define N (1 << 19)

// Segment Tree Beats
// - l<=i<r について、 A_i の値を min(A_i, x) に更新
// - l<=i<r について、 A_i の値を max(A_i, x) に更新
// - l<=i<r の中の A_i の最大値を求める
// - l<=i<r の中の A_i の最小値を求める
// - l<=i<r の A_i の和を求める
// - l<=i<r について、 A_i の値に x を加える
// - l<=i<r について、 A_i の値を x に更新

// 各ノードごとに構造体にまとめる形で実装 (このように実装しないとTLEした)
class SegmentTree {
    struct Node {
        Node *left, *right;
        LL max_v, smax_v, max_c;
        LL min_v, smin_v, min_c;
        LL sum;
        LL len, ladd, lval;

        Node() : left(0), right(0), ladd(0), lval(LINF) {}

        void init(LL x) {
            max_v = min_v = sum = x;
            smax_v = -LINF; smin_v = LINF;
            max_c = min_c = 1;
        }

        void init_empty() {
            max_v = smax_v = -LINF;
            min_v = smin_v = LINF;
            max_c = min_c = 0;
        }

        void update_max(LL x) {
            sum += (x - max_v) * max_c;

            if(max_v == min_v) {
                max_v = min_v = x;
            } else if(max_v == smin_v) {
                max_v = smin_v = x;
            } else {
                max_v = x;
            }

            if(lval != LINF && x < lval) {
                lval = x;
            }
        }

        void update_min(LL x) {
            sum += (x - min_v) * min_c;

            if(max_v == min_v) {
                max_v = min_v = x;
            } else if(max_v == smin_v) {
                min_v = smax_v = x;
            } else {
                min_v = x;
            }

            if(lval != LINF && lval < x) {
                lval = x;
            }
        }

        void addall(LL x) {
            max_v += x;
            if(smax_v != -LINF) smax_v += x;
            min_v += x;
            if(smin_v != LINF) smin_v += x;

            sum += len * x;
            if(lval != LINF) {
                lval += x;
            } else {
                ladd += x;
            }
        }

        void updateall(LL x) {
            max_v = min_v = x;
            smax_v = -LINF; smin_v = LINF;
            max_c = min_c = len;

            sum = len * x;
            lval = x; ladd = 0;
        }

        void push() {

            if(lval != LINF) {
                left->updateall(lval);
                right->updateall(lval);
                lval = LINF;
                return;
            }

            if(ladd != 0) {
                left->addall(ladd);
                right->addall(ladd);
                ladd = 0;
            }

            if(max_v < left->max_v) {
                left->update_max(max_v);
            }
            if(left->min_v < min_v) {
                left->update_min(min_v);
            }

            if(max_v < right->max_v) {
                right->update_max(max_v);
            }
            if(right->min_v < min_v) {
                right->update_min(min_v);
            }
        }

        void update() {
            sum = left->sum + right->sum;

            if(left->max_v < right->max_v) {
                max_v = right->max_v;
                max_c = right->max_c;
                smax_v = max(left->max_v, right->smax_v);
            } else if(left->max_v > right->max_v) {
                max_v = left->max_v;
                max_c = left->max_c;
                smax_v = max(left->smax_v, right->max_v);
            } else {
                max_v = left->max_v;
                max_c = left->max_c + right->max_c;
                smax_v = max(left->smax_v, right->smax_v);
            }

            if(left->min_v < right->min_v) {
                min_v = left->min_v;
                min_c = left->min_c;
                smin_v = min(left->smin_v, right->min_v);
            } else if(left->min_v > right->min_v) {
                min_v = right->min_v;
                min_c = right->min_c;
                smin_v = min(left->min_v, right->smin_v);
            } else {
                min_v = left->min_v;
                min_c = left->min_c + right->min_c;
                smin_v = min(left->smin_v, right->smin_v);
            }
        }
    };

    int n, n0;
    Node *root;

    void _update_min(LL x, int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a || nd->max_v <= x) {
            return;
        }
        if(a <= l && r <= b && nd->smax_v < x) {
            nd->update_max(x);
            return;
        }

        nd->push();
        _update_min(x, a, b, nd->left, l, (l+r)/2);
        _update_min(x, a, b, nd->right, (l+r)/2, r);
        nd->update();
    }

    void _update_max(LL x, int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a || x <= nd->min_v) {
            return;
        }
        if(a <= l && r <= b && x < nd->smin_v) {
            nd->update_min(x);
            return;
        }

        nd->push();
        _update_max(x, a, b, nd->left, l, (l+r)/2);
        _update_max(x, a, b, nd->right, (l+r)/2, r);
        nd->update();
    }

    void _add_val(LL x, int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a) {
            return;
        }
        if(a <= l && r <= b) {
            nd->addall(x);
            return;
        }

        nd->push();
        _add_val(x, a, b, nd->left, l, (l+r)/2);
        _add_val(x, a, b, nd->right, (l+r)/2, r);
        nd->update();
    }

    void _update_val(LL x, int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a) {
            return;
        }
        if(a <= l && r <= b) {
            nd->updateall(x);
            return;
        }

        nd->push();
        _update_val(x, a, b, nd->left, l, (l+r)/2);
        _update_val(x, a, b, nd->right, (l+r)/2, r);
        nd->update();
    }

    LL _query_max(int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a) {
            return -LINF;
        }
        if(a <= l && r <= b) {
            return nd->max_v;
        }
        nd->push();
        LL lv = _query_max(a, b, nd->left, l, (l+r)/2);
        LL rv = _query_max(a, b, nd->right, (l+r)/2, r);
        return max(lv, rv);
    }

    LL _query_min(int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a) {
            return LINF;
        }
        if(a <= l && r <= b) {
            return nd->min_v;
        }
        nd->push();
        LL lv = _query_min(a, b, nd->left, l, (l+r)/2);
        LL rv = _query_min(a, b, nd->right, (l+r)/2, r);
        return min(lv, rv);
    }

    LL _query_sum(int a, int b, Node *nd, int l, int r) {
        if(b <= l || r <= a) {
            return 0;
        }
        if(a <= l && r <= b) {
            return nd->sum;
        }
        nd->push();
        LL lv = _query_sum(a, b, nd->left, l, (l+r)/2);
        LL rv = _query_sum(a, b, nd->right, (l+r)/2, r);
        return lv + rv;
    }

    public:
    SegmentTree(int n, vector<int> a) : n(n) {
        n0 = 1;
        while(n0 < n) n0 <<= 1;

        Node *nds = new Node[2*n0];
        root = nds;

        nds[0].len = n0;
        for(int i=0; i<n0-1; ++i) {
            nds[i].left = &nds[2*i+1];
            nds[i].right = &nds[2*i+2];
            nds[2*i+1].len = nds[2*i+2].len = (nds[i].len >> 1);
        }

        for(int i=0; i<n; ++i) nds[n0-1+i].init(a[i]);
        for(int i=n; i<n0; ++i) nds[n0-1+i].init_empty();
        for(int i=n0-2; i>=0; i--) nds[i].update();
    }

    void update_min(int a, int b, LL x) {
        _update_min(x, a, b, root, 0, n0);
    }

    void update_max(int a, int b, LL x) {
        _update_max(x, a, b, root, 0, n0);
    }

    void add_val(int a, int b, LL x) {
        _add_val(x, a, b, root, 0, n0);
    }

    void update_val(int a, int b, LL x) {
        _update_val(x, a, b, root, 0, n0);
    }

    LL query_max(int a, int b) {
        return _query_max(a, b, root, 0, n0);
    }

    LL query_min(int a, int b) {
        return _query_min(a, b, root, 0, n0);
    }

    LL query_sum(int a, int b) {
        return _query_sum(a, b, root, 0, n0);
    }
};

int main(){
    int x;cin >> x;
    int k;cin >> k;
    vector<int> r(k+1,0);
    for (int i = 0; i < k; i++) {
        cin >> r[i+1];
    }
    r.pb(1e9);
    int q;cin >> q;
    vector<int> t(q),a(q);
    for (int i = 0; i < q; i++) {
        cin >> t[i] >> a[i];
    }
    SegmentTree seg(q,a);
    int id = 0;
    for (int i = 1; i <= k+1; i++) {
        if(id==q) break;
        int tt = r[i] - r[i-1];
        while(id < q && r[i-1] <= t[id] && t[id] <= r[i]){
            if(i%2){
                seg.add_val(id,id+1,-(t[id] - r[i-1]));
                seg.update_max(id,id+1,0);
            }
            else{
                seg.add_val(id,id+1,t[id] - r[i-1]);
                seg.update_min(id,id+1,x);
            }
            cout << seg.query_sum(id,id+1) << endl;
            id++;
        }
        if(i%2){
            seg.add_val(id,q+1,-tt);
            seg.update_max(id,q+1,0);
        }
        else{
            seg.add_val(id,q+1,tt);
            seg.update_min(id,q+1,x);
        }
    }
    return 0;
}


Measured memory_bytes: 27384