#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,m,n) for (int i = (m); i < (n); ++i)
#define rep3(i,a,b) for (int i = (a); i >= (b); --i)
#define all(x) (x).begin(),(x).end()
inline int popcount(const int x) { return __builtin_popcount(x);}
inline ll popcount(const ll x) { return __builtin_popcountll(x);}
template<class T> void chmin(T &a, const T &b) noexcept { if (b < a) a = b;}
template<class T> void chmax(T &a, const T &b) noexcept { if (a < b) a = b;}
template<class T> void drop(const T &x) { std::cout<<x<<endl; exit(0);}
void debug_out() { std::cout << "\n";}
template<class T, class... Args> void debug_out(const T &x, const Args &... args) { std::cout<<x<< " "; debug_out(args...);}
#ifdef _DEBUG
  #define debug(...) debug_out(__VA_ARGS__)
#else
  #define debug(...) 
#endif

struct InitIO{
  InitIO() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(15);
  }
}init_io;

int main() {
  int n, k;
  cin >> n >> k;
  vector<ll> a(n);
  rep(i,n) cin >> a[i];
  vector<ll> S(n-k+1);
  rep(i, k) S[0] += a[i];
  rep2(i, 1, n-k+1) {
    S[i] = a[i+k-1] + S[i-1] - a[i-1];
  }
  sort(all(S));
  // rep(i, n-k+1) debug(S[i]);
  int q;
  cin >> q;
  while(q--) {
    ll x;
    cin >> x;
    int ans = upper_bound(all(S), x) - S.begin();
    cout << ans << "\n";
  }
  return 0;
}