#include <bits/stdc++.h>
using namespace std;
vector<int> denom;
int K, N;
map<int, int> mp;
int main() {
  int i, j, k, l, temp, q, t, n, m, ans, caseno = 0;
  string str;
  while (cin >> N >> K) {
    denom.clear();
    mp.clear();
    mp[0] = 0;
    for (i = 0; i < N; i++) {
      cin >> temp;
      denom.push_back(temp);
      for (j = 1; j <= K; j++) {
        m = temp * j;
        if (mp.find(m) != mp.end())
          mp[m] = min(mp[m], j);
        else
          mp[m] = j;
      }
    }
    sort(denom.begin(), denom.end());
    cin >> q;
    while (q--) {
      cin >> m;
      if (m < denom[0] || m > denom[N - 1] * K) {
        cout << -1 << endl;
        continue;
      }
      j = N - 1;
      ans = K + 1;
      for (j = N - 1; j >= 0; j--) {
        if (denom[j] > m) continue;
        for (l = 1; l <= K; l++) {
          temp = m - denom[j] * l;
          if (mp.find(temp) == mp.end()) continue;
          ans = min(ans, l + mp[temp]);
        }
      }
      if (ans <= K)
        cout << ans << endl;
      else
        cout << -1 << endl;
    }
  }
  return 0;
}
