#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ll int
typedef pair<int,int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 10010
#define INF (ll)(1e9+10)
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
typedef pair <pi,pi> pipi;
int N,L,A[maxn];
int Q,k;
int B[105];
map <int,int> C;
int num[105][maxn], ans[105][maxn];
int32_t main(){
fast;
cin >> N >> L;
FOR(i,1,N) cin >> A[i];
cin >> Q;
vi v;
FOR(i,1,Q){
cin >> B[i]; v.pb(B[i]);
}
sort(all(v)); v.erase(unique(all(v)), v.end());
FOR(i,2,N+1-L){
int cur = 0;
FOR(j,1,L) cur += (A[j] != A[i+j-1]);
FOR(j,0,N+1-L-i){
int k = lbd(v, cur) - v.begin();
num[k][j+1]++, num[k][i+j]++;
//cout << i+j << ' ' << j+1 << ' ' << cur << '\n';
cur -= A[j+1] != A[j+i];
cur += A[j+1+L] != A[j+i+L];
}
}
FOR(i,1,v.size()-1) FOR(j,1,N) num[i][j] += num[i-1][j];
FOR(i,1,Q){
int k = lbd(v, B[i]) - v.begin();
FOR(j,1,N-L+1) cout << num[k][j] << ' ';
cout << '\n';
}
}
