#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
template <typename T>
T read()
{
    T v;
    return std::cin >> v, v;
}
template <typename T>
std::vector<T> readVec(const std::size_t l)
{
    std::vector<T> v(l);
    for (auto& e : v) { std::cin >> e; }
    return v;
}
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }
template <typename T>
bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!=====================================!//
//!  8888ba.88ba           oo           !//
//!  88  '8b  '8b                       !//
//!  88   88   88 .d8888b. dP 88d888b.  !//
//!  88   88   88 88'  '88 88 88'  '88  !//
//!  88   88   88 88.  .88 88 88    88  !//
//!  dP   dP   dP '88888P8 dP dP    dP  !//
//!=====================================!//
int main()
{
    const ll X = read<ll>();
    const int K = read<int>();
    std::vector<ll> r(K + 1, 0LL);
    for (int i = 1; i <= K; i++) { std::cin >> r[i]; }
    std::vector<ll> al(K + 1, 0), ah(K + 1, X), b(K + 1, 0), c(K + 1, X);
    for (int i = 1; i <= K; i++) {
        const ll pal = al[i - 1], pah = ah[i - 1], pb = b[i - 1], pc = c[i - 1];
        const ll d = r[i] - r[i - 1];
        if (i % 2 == 1) {
            if (pb >= d) {
                al[i] = pal, ah[i] = pah, b[i] = pb - d, c[i] = pc - d;
            } else if (pc <= d) {
                al[i] = 0, ah[i] = 0, b[i] = 0, c[i] = 0;
            } else {
                al[i] = pal + d - pb, ah[i] = pah, b[i] = 0, c[i] = pc - d;
            }
        } else {
            if (pc <= X - d) {
                al[i] = pal, ah[i] = pah, b[i] = pb + d, c[i] = pc + d;
            } else if (pb >= X - d) {
                al[i] = 0, ah[i] = 0, b[i] = X, c[i] = X;
            } else {
                al[i] = pal, ah[i] = pah - (pc - X + d), b[i] = pb + d, c[i] = X;
            }
        }
    }
    const int Q = read<int>();
    for (int q = 0; q < Q; q++) {
        const ll t = read<ll>(), a = read<ll>();
        const int i = std::upper_bound(r.begin(), r.end(), t) - r.begin() - 1;
        const ll dt = t - r[i];
        const ll alpha = (a <= al[i] ? b[i] : a >= ah[i] ? c[i] : b[i] + (a - al[i])), ans = alpha + (i % 2 == 0 ? -dt : dt);
        std::cout << std::min(X, std::max(ans, 0LL)) << std::endl;
    }
    return 0;
}


Measured memory_bytes: 5120