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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.UncheckedIOException;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in Actual solution is at the top
 * 
 * @author daltao
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "daltao", 1 << 27);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            TaskB solver = new TaskB();
            solver.solve(1, in, out);
            out.close();
        }
    }
    static class TaskB {
        public void solve(int testNumber, FastInput in, FastOutput out) {
            int x = in.readInt();
            int k = in.readInt();
            int[] r = new int[k + 1];
            for (int i = 1; i <= k; i++) {
                r[i] = in.readInt();
            }


            BulkAddSubArray b = new BulkAddSubArray(0, x);
            BulkAddSubArray[] blocks = new BulkAddSubArray[k + 1];
            blocks[0] = b.clone();
            for (int i = 1; i <= k; i++) {
                if (i % 2 == 1) {
                    // lose
                    b.bulkSubtract(r[i] - r[i - 1]);
                } else {
                    b.bulkAdd(r[i] - r[i - 1]);
                }
                blocks[i] = b.clone();
            }

            int q = in.readInt();
            for (int i = 0; i < q; i++) {
                int t = in.readInt();
                int a = in.readInt();

                int index = SequenceUtils.floorIndex(r, t);
                int remain = (int) blocks[index].get(a);

                if (index % 2 == 0) {
                    // lose
                    remain = Math.max(0, remain - (t - r[index]));
                } else {
                    remain = Math.min(x, remain + (t - r[index]));
                }
                out.println(remain);
            }
        }

    }
    static class FastInput {
        private final InputStream is;
        private byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

    }
    static class FastOutput implements AutoCloseable, Closeable {
        private StringBuilder cache = new StringBuilder(10 << 20);
        private final Writer os;

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput println(int c) {
            cache.append(c).append('\n');
            return this;
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

    }
    static class SequenceUtils {
        public static int floorIndex(int[] data, int x) {
            int index = Arrays.binarySearch(data, x);
            if (index < 0) {
                return -(index + 1) - 1;
            }
            return index;
        }

    }
    static class BulkAddSubArray implements Cloneable {
        private long l;
        private long r;
        private long lCnt;
        private long min;
        private long max;

        public BulkAddSubArray(long l, long r) {
            this.l = l;
            this.r = r;
            this.lCnt = 1;
            this.min = l;
            this.max = r;
        }

        public void bulkAdd(int x) {
            if (r + x <= max) {
                l += x;
                r += x;
                return;
            }

            // r + x >= max => x >= max - r
            long t = max - r;
            if (t > l) {
                r = t;
            } else {
                l = r;
            }

            l = Math.min(l + x, max);
            r = Math.min(r + x, max);
        }

        public void bulkSubtract(int x) {
            if (l - x >= min) {
                l -= x;
                r -= x;
                return;
            }

            // t - x = min => t = x + min
            long t = x + min;
            if (t < r) {
                lCnt += t - l;
                l = t;
            } else {
                l = r;
            }

            l = Math.max(l - x, min);
            r = Math.max(r - x, min);
        }

        public long get(long i) {
            if (l == r) {
                return l;
            }
            if (i < lCnt) {
                return l;
            }
            i -= lCnt;
            if (i < r - l - 1) {
                return i + l + 1;
            }
            return r;
        }

        public BulkAddSubArray clone() {
            try {
                return (BulkAddSubArray) super.clone();
            } catch (CloneNotSupportedException e) {
                throw new RuntimeException(e);
            }
        }

    }
}