#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

struct border{
  long long ub_in;
  long long lb_in;
  long long ub_out;
  long long lb_out;
};
border merge(border l, border r){
  border res;
  res.ub_in = l.ub_in;
  res.lb_in = l.lb_in;

  res.ub_out = r.ub_out;
  res.lb_out = r.lb_out;

  if( l.lb_out > r.ub_in ){
    res.lb_out = r.ub_out;
    res.ub_out = r.ub_out;

    res.lb_in = -1;
    res.ub_in = -1;
    return res;
  }

  if( l.ub_out < r.lb_in ){
    res.lb_out = r.lb_out;
    res.ub_out = r.lb_out;

    res.lb_in = -1;
    res.ub_in = -1;
    return res;
  }

  if( l.ub_out < r.ub_in ){
    long long d = abs(r.ub_in - l.ub_out);
    res.ub_out -= d;
  }else{
    long long d = abs(l.ub_out - r.ub_in);
    if(res.ub_in != -1) res.ub_in -= d;
  }

  if( l.lb_out < r.lb_in ){
    long long d = abs(r.lb_in - l.lb_out);
    if(res.lb_in != -1) res.lb_in += d;
  }else{
    long long d = abs(l.lb_out - r.lb_in);
    res.lb_out += d;
  }


  return res;
}


int main(){
  long long x;
  cin >> x;
  int k;
  cin >> k;
  vector<long long> r(k);
  cin >> r;
  r.push_back(1ll<<50);

  vector<long long> d(r.size());
  for(int i=0; i<r.size(); i++){
    d[i] = r[i];
    if(i) d[i] -= r[i-1];
  }

  vector<border> B(r.size());
  for(int i=0; i<r.size(); i++){
    if(i%2 == 0){
      B[i] = border{
        x,
        min(x, d[i]),
        max(0LL, x-d[i]),
        0
      };
    }else{
      B[i] = border{
        max(0LL, x-d[i]),
        0,
        x,
        min(x, d[i])
      };
    }
  }
  for(int i=1; i<r.size(); i++){
    B[i] = merge(B[i-1], B[i]);
    assert( B[i].lb_in <= B[i].ub_in );
    assert( B[i].lb_out <= B[i].ub_out );
  }

  vector<long long> T(r.size()+1);
  for(int i=0; i<r.size(); i++){
    T[i+1] = T[i];
    if(i%2 == 0){
      T[i+1] -= d[i];
    }else{
      T[i+1] += d[i];
    }
  }

  border b0{
    x,
    0,
    x,
    0
  };

  int q;
  cin >> q;
  while(q--){
    int t,a;
    cin >> t,a;

    int i = upper_bound(r.begin(), r.end(), t) - r.begin();
    auto b = i>0 ? B[i-1] : b0;
    if( b.lb_in <= a && a <= b.ub_in ){
      long long unko = a - b.lb_in;
      a = b.lb_out + unko;
    }else{
      if( b.lb_in > a ){
        a = b.lb_out;
      }else{
        a = b.ub_out;
      }
    }

    long long dd = t;
    if(i) dd -= r[i-1];

    long long val = a;// + T[i];
    if(i%2 == 0){
      val -= dd;
    }else{
      val += dd;
    }
    val = min(val, x);
    val = max(val, 0LL);

    println(val);
  }

  return 0;
}


Measured memory_bytes: 8304