We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of sand.
When we put the sandglass, either bulb A or B lies on top of the other and becomes the upper bulb. The other bulb becomes the lower bulb.
The sand drops from the upper bulb to the lower bulb at a rate of 1 gram per second.
When the upper bulb no longer contains any sand, nothing happens.
Initially at time 0, bulb A is the upper bulb and contains a grams of sand; bulb B contains X-a grams of sand (for a total of X grams).
We will turn over the sandglass at time r_1,r_2,..,r_K. Assume that this is an instantaneous action and takes no time. Here, time t refer to the time t seconds after time 0.
You are given Q queries.
Each query is in the form of (t_i,a_i).
For each query, assume that a=a_i and find the amount of sand that would be contained in bulb A at time t_i.

-----Constraints-----
 - 1≤X≤10^9
 - 1≤K≤10^5
 - 1≤r_1<r_2< .. <r_K≤10^9
 - 1≤Q≤10^5
 - 0≤t_1<t_2< .. <t_Q≤10^9
 - 0≤a_i≤X (1≤i≤Q)
 - All input values are integers.

-----Input-----
The input is given from Standard Input in the following format:
X
K
r_1 r_2 .. r_K
Q
t_1 a_1
t_2 a_2
:
t_Q a_Q

-----Output-----
For each query, print the answer in its own line.

-----Sample Input-----
180
3
60 120 180
3
30 90
61 1
180 180

-----Sample Output-----
60
1
120

In the first query, 30 out of the initial 90 grams of sand will drop from bulb A, resulting in 60 grams.
In the second query, the initial 1 gram of sand will drop from bulb A, and nothing will happen for the next 59 seconds. Then, we will turn over the sandglass, and 1 second after this, bulb A contains 1 gram of sand at the time in question.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'from bisect import bisect\nX=int(input())\nK=int(input())\nrs=[0]\nfor r in input().split():\n  rs.append(int(r))\nA=[[(0,0),(X,X)]]\nmin_sup=0\nmax_inf=X\npre_r=0\nfor i,r in enumerate(rs[1:]):\n  d=r-pre_r\n  pre_r=r\n  m,M=A[-1][0][0],A[-1][1][0]\n  if i%2==0:\n    if m-d>=0:\n      new_m=m-d\n    else:\n      new_m=0\n      min_sup=min_sup+d-m\n    if M-d>0:\n      new_M=M-d\n    else:\n      new_M=0\n      max_inf=0\n  else:\n    if M+d<=X:\n      new_M=M+d\n    else:\n      new_M=X\n      max_inf=max_inf-(d-(X-M))\n    if m+d<X:\n      new_m=m+d\n    else:\n      new_m=X\n      min_sup=X\n  if new_m==new_M:\n    min_sup=X\n    max_inf=0             \n  A.append([(new_m,min_sup),(new_M,max_inf)])\nQ=int(input())\nfor q in range(Q):\n  t,a=list(map(int,input().split()))\n  r_num=bisect(rs,t)-1\n  m,min_sup=A[r_num][0]\n  M,max_inf=A[r_num][1]\n  r=rs[r_num]\n  if r_num%2==0:\n    if a<=min_sup:\n      print((max(m-(t-r),0)))\n    elif min_sup<a<max_inf:\n      print((max(m+(a-min_sup)-(t-r),0)))\n    else:\n      print((max(M-(t-r),0)))\n  else:\n    if a<=min_sup:\n      print((min(m+(t-r),X)))\n    elif min_sup<a<max_inf:\n      print((min(m+(a-min_sup)+(t-r),X)))\n    else:\n      print((min(M+(t-r),X)))\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14155