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 = 'X = int(input())\nK = int(input())\nR = list(map(int,input().split()))\nR.append(0)\n\nA = [X for _ in range(K+1)]\nB = [0 for _ in range(K+1)]\nC = [X for _ in range(K+1)]\nD = [0 for _ in range(K+1)]\nstate = -1\nfor i in range(K):\n  dr = R[i] - R[i-1]\n  if state == -1:\n    C[i+1] = max(0, C[i]-dr)\n    D[i+1] = max(0, D[i]-dr)\n    B[i+1] = min(B[i] + (-min(0, D[i]-dr)), A[i])\n    A[i+1] = A[i]\n    \n  else:\n    C[i+1] = min(X, C[i]+dr)\n    D[i+1] = min(X, D[i]+dr)\n    A[i+1] = max(A[i] - max(0, C[i]+dr-X), B[i])\n    B[i+1] = B[i]\n\n  state *= -1\n"""\nprint(A)\nprint(B)\nprint(C)\nprint(D)\n"""\n\nQ = int(input())\nR.pop()\nimport bisect\nfor _ in range(Q):\n  t, a = list(map(int,input().split()))\n  j = bisect.bisect_right(R, t)\n  if j == 0: r = 0\n  else: r = R[j-1]\n  pre_ans = (min(A[j],max(B[j],a)) - B[j]) + D[j]\n  #print(pre_ans)\n  pre_ans += ((-1)**(1-j%2)) * (t-r)\n  #print(j, t, r)\n  print((min(X, max(0, pre_ans))))\n  \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14243