#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define fi first
#define  se second
#define pii pair <int, int>
 
signed main(){
    int n, p, q;
    cin >> n >> p >>q;
    pii e[n];
    for (int i =1; i <=n; i++){
        int x;
        cin >> x;
        e[i] = {x, i};
    }
    sort(e+1, e+1+n);
    vector <int> ans(n+5);
    priority_queue <pair<int,pii>> pq;
    for (int i =1, j =1; i <= n ; i++){
        while( j < n && e[j+1].fi - e[i].fi <= p) j++;
        pq.push({j-i+1, {i, j}});
        while(!pq.empty() && (pq.top().se.fi > i || i > pq.top().se.se)) pq.pop();
        ans[e[i].se] = pq.top().fi;
    }
 
    for (int i =0; i < q; i++){
        int x;
        cin >> x;
        cout << ans[x] << endl;
    }
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Ci8vI2RlZmluZSBpbnQgbG9uZyBsb25nCiNkZWZpbmUgZmkgZmlyc3QKI2RlZmluZSAgc2Ugc2Vjb25kCiNkZWZpbmUgcGlpIHBhaXIgPGludCwgaW50PgoKc2lnbmVkIG1haW4oKXsKICAgIGludCBuLCBwLCBxOwogICAgY2luID4+IG4gPj4gcCA+PnE7CiAgICBwaWkgZVtuXTsKICAgIGZvciAoaW50IGkgPTE7IGkgPD1uOyBpKyspewogICAgICAgIGludCB4OwogICAgICAgIGNpbiA+PiB4OwogICAgICAgIGVbaV0gPSB7eCwgaX07CiAgICB9CiAgICBzb3J0KGUrMSwgZSsxK24pOwogICAgdmVjdG9yIDxpbnQ+IGFucyhuKzUpOwogICAgcHJpb3JpdHlfcXVldWUgPHBhaXI8aW50LHBpaT4+IHBxOwogICAgZm9yIChpbnQgaSA9MSwgaiA9MTsgaSA8PSBuIDsgaSsrKXsKICAgICAgICB3aGlsZSggaiA8IG4gJiYgZVtqKzFdLmZpIC0gZVtpXS5maSA8PSBwKSBqKys7CiAgICAgICAgcHEucHVzaCh7ai1pKzEsIHtpLCBqfX0pOwogICAgICAgIHdoaWxlKCFwcS5lbXB0eSgpICYmIChwcS50b3AoKS5zZS5maSA+IGkgfHwgaSA+IHBxLnRvcCgpLnNlLnNlKSkgcHEucG9wKCk7CiAgICAgICAgYW5zW2VbaV0uc2VdID0gcHEudG9wKCkuZmk7CiAgICB9CiAgICAKICAgIGZvciAoaW50IGkgPTA7IGkgPCBxOyBpKyspewogICAgICAgIGludCB4OwogICAgICAgIGNpbiA+PiB4OwogICAgICAgIGNvdXQgPDwgYW5zW3hdIDw8IGVuZGw7CiAgICB9Cn0=

NiA1IDIKMSA2IDggMyAxMCAyCjIKNQ==

6 5 2
1 6 8 3 10 2
2
5