#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;cnt<(l);++cnt)
#define iterate(cnt,b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }

mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        inline MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) {
            for (auto it = begin; it != end; ++it) *this >> *it;
        }
    };
}
MaiScanner scanner;



class unionfind {
public:
    vector<int> data;
    unionfind(int size) : data(size, -1) { }
    bool union_set(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
            if (data[y] < data[x]) swap(x, y);
            data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    inline bool find_set(int x, int y) {
        return root(x) == root(y);
    }
    inline int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    inline int size(int x) {
        return -data[root(x)];
    }
};


// 境界を探す．func(x)==trueとなるxの中で，最も小さなxを探す．
// func(x):boolとは，ある定数tを持ち，(t<=x)を返す関数である．
// func(x)==falseとなるxの中で，最も大きなxを探す時，コメントアウトのやつ．
template<typename INTEGER>
INTEGER b_search(INTEGER l, INTEGER h, auto func) {
    ++h;
    // --l;
    INTEGER c;
    while (l + 1 < h) {
        c = (l + h) / 2;
        if (func(c)) {
            h = c;
        }
        else {
            l = c;
        }
    }
    return h;
    // return l;
}



const ll MD9 = 998244353ll;

ll m, n, kei, xx;

ll rr[100010];

ll aa[100010];

int main() {

    scanner >> xx >> kei;
    scanner.in(rr, rr + kei);

    rr[kei] = (ll)1e9 + 10;

    int _qq;
    scanner >> _qq;

    ll idx = 0;

    ll high = xx;
    ll low = 0;
    ll left = 0;
    ll right = xx;

    ll offset = 0;

    //ll cursor = 0;
    ll prev = 0;
    repeat(_, _qq) {
        ll tt, a;
        scanner >> tt >> a;

        while (rr[idx] <= tt) {
            ll t = rr[idx] - prev;
            if (idx % 2 == 0) {
                // パーツA減る
                low = max(low - t, 0ll);
                high = max(high - t, 0ll);
                offset -= t;
            }
            else {
                // パーツA増える
                low = min(low + t, xx);
                high = min(high + t, xx);
                offset += t;
            }
            left = max(left, -offset);
            right = min(right, xx - offset);
            prev = rr[idx++];
        }

        //a = max(left, min(right, a + offset));
        if (left <=a && a <= right)
            a = a + offset;
        else
            a = a < left ? low : high;

        if (idx % 2 == 0) {
            printf("%lld\n", max(0ll, a - tt + prev));
        }
        else{
            printf("%lld\n", min(xx, a + tt - prev));
        }
    }




    return 0;
}

Measured memory_bytes: 2048