#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll,ll> P;
typedef string str;
typedef vector<P> vp;
typedef vector<string> vs;
typedef vector<bool> vb;

const ll mod=1e9+7;
const ll inf=1e18;

#define rep(i,m,n) for(ll i=m;i<n;i++)
#define repr(i,m,n) for(ll i=m-1;i>=n;i--)
#define fi first
#define se second
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define eb(x) emplace_back(x)
#define pb(x) pop_back(x)
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define sum(x) accumulate(all(x),0)
#define lb(x,a) lower_bound(all(x),a)
#define ub(x,a) upper_bound(all(x),a)
#define maxe(x,a) max_element(all(x))
#define mine(x,a) min_element(all(x))
#define pc(x) __builtin_popcount(x)
#define gll greater<ll>()

ll mod_pow(ll x, ll n){
 if(n==0) return 1;
ll res=mod_pow(x*x%mod,n/2);
if(n&1) res=res*x%mod;
return res;
}

void solve(){
 ll n,k;
  cin >> n >> k;
  vll a(n);
  rep(i,0,n) cin >> a[i];
 vll s;
  ll now=0;
  rep(i,0,k) now+=a[i];
  s.eb(now);
  
  rep(i,0,n-k){
   now-=a[i];
   now+=a[i+k];
   s.eb(now); 
  }
  sort(all(s));
  ll q;
  cin >> q;
  while(q--){
   ll x;
    cin >> x;
    cout << ub(s,x)-s.begin() << endl;
  }
}
int main(){
   cin.tie(nullptr);
  ios::sync_with_stdio(false);
  solve();
}