Problem:
Score : 700 points

Problem Statement

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 1

180
3
60 120 180
3
30 90
61 1
180 180

Sample Output 1

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.

Sample Input 2

100
1
100000
4
0 100
90 100
100 100
101 100

Sample Output 2

100
10
0
0

In every query, the upper bulb initially contains 100 grams, and the question in time comes before we turn over the sandglass.

Sample Input 3

100
5
48 141 231 314 425
7
0 19
50 98
143 30
231 55
342 0
365 100
600 10

Sample Output 3

19
52
91
10
58
42
100

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Diagnostics;



class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Scanner cin;
    
    void calc()
    {
        cin = new Scanner();
        int X = cin.nextInt();
        int K = cin.nextInt();
        int[] r = new int[K + 1];
        for (int i = 0; i < K; i++)
        {
            r[i] = cin.nextInt();
        }
        r[K] = int.MaxValue / 2;
        int Q = cin.nextInt();
        int[] t = new int[Q];
        int[] a = new int[Q];
        for (int i = 0; i < Q; i++)
        {
            t[i] = cin.nextInt();
            a[i] = cin.nextInt();
        }

        int now = 0;

        int leftPoint = 0;
        int leftValue = 0;
        int rightPoint = X;
        int rightValue = X;

        int tp = 0;

        for (int i = 0; i < K + 1; i++)
        {
            while(tp < t.Length && t[tp] <= r[i])
            {
                int nowA;
                if (a[tp] <= leftPoint) nowA = leftValue;
                else if (a[tp] >= rightPoint) nowA = rightValue;
                else nowA = leftValue + (a[tp] - leftPoint);

                if (i % 2 == 0) nowA -= (t[tp] - now);
                else nowA += (t[tp] - now);

                if (nowA < 0) nowA = 0;
                if (nowA > X) nowA = X;

                Console.WriteLine(nowA);
                tp++;
            }

            int move = r[i] - now;

            if (i % 2 == 0) {
                leftValue -= move;
                if (leftValue < 0)
                {
                    leftPoint -= leftValue;
                    leftValue = 0;
                }
                rightValue -= move;
                if (rightValue < 0) rightValue = 0;
            }
            else
            {
                leftValue += move;
                if (leftValue > X)
                {
                    leftValue = X;
                }
                rightValue += X;
                if (rightValue >= X)
                {
                    rightPoint -= (rightValue - X);
                    rightValue = X;
                }
            }
            now = r[i];
            
        }
    }

    //swap
    void swap<T>(ref T a, ref T b)
    {
        T c = a;
        a = b;
        b = c;
    } 

    long calcT(long ax, long ay, long bx, long by)
    {
        return (ax * by) - (bx * ay);
    }

        
}


class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        if (s.Length == 0) return next();
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }
    public int[] ArrayInt(int N, int add = 0)
    {
        int[] Array = new int[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextInt() + add;
        }
        return Array;
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public long[] ArrayLong(int N, long add = 0)
    {
        long[] Array = new long[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextLong() + add;
        }
        return Array;
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }


    public double[] ArrayDouble(int N, double add = 0)
    {
        double[] Array = new double[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextDouble() + add;
        }
        return Array;
    }
}