#include <bits/stdc++.h>
using namespace std;
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi," ",x.se);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
//===================//
// Added libraries //
//===================//
//===================//
//end added libraries//
//===================//
void program();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
program();
}
//===================//
// begin program //
//===================//
const int MX = 10000;
int n, m, l, q;
int a[MX], b[MX], k[MX];
vi f[MX];
int dist[MX];
int ans[100][MX];
int getDif(int x, int y) {
int ans=0;
RE(i,l) if(a[x+i] != a[y+i]) ans++;
return ans;
}
void getDif(int x) {
// fill dist table
RE(i,n) dist[i] = l;
RE(i,l) {
auto lb = lower_bound(all(f[a[x+i]]),i);
auto ub = upper_bound(all(f[a[x+i]]),n-l+1-i);
while(lb != ub) {
dist[*lb-i]--;
lb++;
}
}
// answer queries
sort(dist,dist+n-l+1);
RE(i,q) {
ans[i][x] = upper_bound(dist,dist+n-l+1,k[i])-dist-1;
}
}
void program() {
IN(n, l);
RE(i,n) IN(a[i]);
IN(q);
RE(i,q) IN(k[i]);
RE(i,n) b[i]=a[i];
sort(b,b+n);
m = unique(b,b+n)-b;
RE(i,n) a[i] = lower_bound(b,b+m,a[i])-b;
RE(i,n) f[a[i]].pb(i);
RE(i,n-l+1) getDif(i);
RE(i,q) {
RE(j,n-l+1) OUT(j==0?"":" ",ans[i][j]);
OUTL();
}
}
