Jeronimo the bear loves numbers and he is planning to write n numbers in his notebook.
After writing the first m numbers, Jeronimo felt that he was spending a lot of time thinking new numbers, so he wrote the next n - m missing numbers as the sum modulo 3 × 107 of the numbers in the i - m and i - m + 1 positions for m < i ≤ n
While Jeronimo was writing, his sister Lupe arrived and asked him q questions. The i - th question consist of a number bi, Jeronimo has to say what would be the number in the position bi if all the numbers were sorted in ascending order. Jeronimo wants to answer each question as soon as possible but he spends a lot of time counting so he ask your help.
The first line of the input has three integers n (3 ≤ n ≤ 3 × 107), m (3 ≤ m ≤ min(100, n)) and q (1 ≤ q ≤ 10000).
The second line contains m numbers a1, a2, ..., am, (0 ≤ ai < 3 × 107), The first m numbers that Jeronimo wrote.
The third line contains q questions b1, b2, ..., bq (1 ≤ bi ≤ n)
Print q lines. The i - th line must be the answer of the i - th question made by Lupe.
## Input
The first line of the input has three integers n (3 ≤ n ≤ 3 × 107), m (3 ≤ m ≤ min(100, n)) and q (1 ≤ q ≤ 10000).The second line contains m numbers a1, a2, ..., am, (0 ≤ ai < 3 × 107), The first m numbers that Jeronimo wrote.The third line contains q questions b1, b2, ..., bq (1 ≤ bi ≤ n)
## Output
Print q lines. The i - th line must be the answer of the i - th question made by Lupe.
[samples]
**Definitions**
Let $ n, m, q \in \mathbb{Z}^+ $ with $ 3 \leq n \leq 3 \times 10^7 $, $ 3 \leq m \leq \min(100, n) $, and $ 1 \leq q \leq 10^4 $.
Let $ A = (a_1, a_2, \dots, a_m) $ be the initial sequence of $ m $ integers, where $ 0 \leq a_i < 3 \times 10^7 $.
Define a sequence $ S = (s_1, s_2, \dots, s_n) $ as follows:
- $ s_i = a_i $ for $ 1 \leq i \leq m $,
- $ s_i = (s_{i-m} + s_{i-m+1}) \mod (3 \times 10^7) $ for $ m < i \leq n $.
Let $ B = (b_1, b_2, \dots, b_q) $ be a sequence of query indices, where $ 1 \leq b_j \leq n $.
**Constraints**
1. $ 3 \leq n \leq 3 \times 10^7 $
2. $ 3 \leq m \leq \min(100, n) $
3. $ 1 \leq q \leq 10^4 $
4. $ 0 \leq a_i < 3 \times 10^7 $ for all $ i \in \{1, \dots, m\} $
5. $ 1 \leq b_j \leq n $ for all $ j \in \{1, \dots, q\} $
**Objective**
For each query $ b_j $, compute the value of the $ b_j $-th smallest element in the sorted sequence $ S $.
That is, let $ S_{\text{sorted}} $ be the sequence $ S $ sorted in non-decreasing order. Output $ S_{\text{sorted}}[b_j] $ for each $ j \in \{1, \dots, q\} $.