#include <bits/stdc++.h>
using namespace std;
namespace std {
template <class S, class T>
struct hash<pair<S, T>> {
  size_t operator()(const pair<S, T> &p) const {
    return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
  }
};
template <class T>
struct hash<vector<T>> {
  size_t operator()(const vector<T> &v) const {
    size_t h = 0;
    for (auto i : v) h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
    return h;
  }
};
}  // namespace std
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[ ";
  for (int i = 0; i < (int)v.size(); i++)
    os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "{ ";
  for (const auto &i : v) os << i << ", ";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
  os << "{";
  for (const auto &i : v) os << " " << i.first << ": " << i.second << ",";
  return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
  cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
  dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  int x, k, q;
  cin >> x >> k;
  vector<int> r(k + 1);
  for (int i = 0; i < (int)k; i++) cin >> r[i + 1];
  cin >> q;
  vector<pair<int, int>> qs;
  for (int i = 0; i < (int)q; i++) {
    int t, a;
    cin >> t >> a;
    qs.emplace_back(t, a);
  }
  int qi = 0;
  int a = 0, b = 0, c = x, d = x;
  for (int i = 0; i < (int)k + 1; i++) {
    while (qi < q && (i == k || qs[qi].first <= r[i + 1])) {
      int t = qs[qi].first - r[i];
      int s = qs[qi].second;
      int ans = s <= a ? b : s <= c ? b + s - a : d;
      if (i % 2)
        ans = min(x, ans + t);
      else
        ans = max(0, ans - t);
      cout << ans << endl;
      qi++;
    }
    if (i == k) break;
    int t = r[i + 1] - r[i];
    if (i % 2) {
      if (d + t <= x)
        b += t, d += t;
      else if (b + t >= x)
        a = 0, b = x, c = x, d = x;
      else {
        c -= t - (x - d);
        d = x;
        b += t;
      }
    } else {
      if (t <= b)
        b -= t, d -= t;
      else if (t <= d) {
        a += t - b;
        b = 0;
        d -= t;
      } else
        a = 0, b = 0, c = x, d = 0;
    }
  }
  return 0;
}
