#include <iostream>
#include <algorithm>
#include <math.h>
#include <set>
#include <queue>
using namespace std;
const int maxn=3e5+5;
typedef long long ll;
const ll inf=1e18;
class Compare{
public:
bool operator()(pair < ll, ll > a, pair < ll, ll > b){
if(a.first!=b.first){
return a.first<b.first;
}
return a.second>b.second;
}
};
priority_queue < pair < ll, ll >, vector < pair < ll, ll > >, Compare > svi;
set < pair < ll, ll > > s;
ll a[maxn];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll m, n, q;
cin >> m >> n >> q;
s.insert({0, m-1});
set < pair < ll, ll > >::const_iterator it;
pair < ll, ll > p;
for(int i=0; i<n; i++){
cin >> a[i];
a[i]--;
it=s.upper_bound({a[i], inf});
it--;
p=*it;
s.erase(it);
if(p.first!=a[i]){
s.insert({p.first, a[i]-1});
}
if(p.second!=a[i]){
s.insert({a[i]+1, p.second});
}
}
for(it=s.begin(); it!=s.end(); it++){
p=*it;
svi.push({p.second-p.first+1, p.first});
}
ll val;
ll pos=n;
ll b;
ll br;
for(int i=0; i<q; i++){
cin >> b;
if(b<=pos){
cout << a[b-1]+1 << '\n';
continue;
}
while(pos<b){
p=svi.top();
svi.pop();
br=p.first;
// cout << "radim " << p.first << " " << p.second << endl;
val=p.second+(br-1)/2;
if(val!=p.second){
svi.push({val-p.second, p.second});
}
if(val!=p.second+br-1){
svi.push({p.second+br-1-val, val+1});
}
pos++;
}
cout << val+1 << '\n';
}
return 0;
}
