J - Jeronimo's List Gym - 101466J （桶排序+二分）

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.

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 mnumbers 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.

Examples

Input

6 3 6
1 2 3
1 2 3 4 5 6

Output

1
2
3
3
5
6

Input

10 4 3
1 2 9 10
1 5 10

Output

1
10
30

//Full of love and hope for life

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <queue>
#include <map>
#define inf 0x3f3f3f3f
//https://paste.ubuntu.com/
//https://www.cnblogs.com/zzrturist/    //博客园
//https://blog.csdn.net/qq_44134712     //csdn

using namespace std;

typedef long long ll;
const ll maxn=6e7;
int n[maxn];
int m[maxn];

int main()
{
    int a,b,c,x;
    cin >> a >> b >> c;
    memset(m,0,sizeof(m));
    for(int i=1; i<=b; i++)
    {
        cin >> n[i];
         m[n[i]]++;
    }
    for(int i=b+1; i<=a; i++)
    {
        n[i]=(n[i-b]+n[i-b+1])%30000000;
        m[n[i]]++;
    }
    for(int i=1;i<=30000000;i++){
        m[i]+=m[i-1];
    }
    while(c--)
    {
        cin >> x;
        int t=lower_bound(m,m+maxn,x)-m;
        cout << t << endl;
    }
    return 0;
}