// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 1e5 + 5;

int N, Q, X;
int R[MAXN];
Pii QRY[MAXN];

void input()
{
    read(X); read(N);
    for (int i = 1; i <= N; ++i) {
        read(R[i]);
    }
    read(Q);
    for (int i = 1; i <= Q; ++i) {
        read(QRY[i].x); read(QRY[i].y);
    }
}

int A, B, C, T, F;

void update(int x)
{
    int t = x - T;
    if (F == 1) {
        if (B + C + t <= X)
            C += t;
        else if (A + C + t > X) {
            A = B = 0;
            C = X;
        } else {
            C += t;
            B = X - C;
        }
    } else {
        if (A + C - t >= 0)
            C -= t;
        else if (B + C + t < 0) {
            A = B = X;
            C = -X;
        } else {
            C -= t;
            A = -C;
        }
    }
    T = x;
}

inline int query(int x)
{
    if (x < A)
        return A + C;
    if (x > B)
        return B + C;
    return x + C;
}

void solve()
{
    A = 0; B = X; C = 0; F = -1;
    int p = 1;
    for (int i = 1; i <= N; ++i) {
        for (; p <= Q && QRY[p].x <= R[i]; ++p) {
            update(QRY[p].x);
            printf("%d\n", query(QRY[p].y));
        }
        update(R[i]);
        F = -F;
    }
    for (; p <= Q; ++p) {
        update(QRY[p].x);
        printf("%d\n", query(QRY[p].y));
    }
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();
}

// 木受绳则直，人受谏则正。
