#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<pair<int, int> > sums;
int main() {
  cin >> n >> k;
  vector<int> arr(n);
  for (int i = 0; i < n; ++i) {
    cin >> arr[i];
    for (int j = 0; j <= k; ++j) {
      sums.push_back({j * arr[i], j});
    }
  }
  sort(sums.begin(), sums.end());
  sums.resize(unique(sums.begin(), sums.end()) - sums.begin());
  int m;
  cin >> m;
  for (int i = 0; i < m; ++i) {
    int q;
    cin >> q;
    int ans = 21;
    for (int j = 0; j < n; ++j) {
      for (int t = 0; t <= k; ++t) {
        int need = q - t * arr[j];
        pair<int, int> ask = {need, 0};
        int id = lower_bound(sums.begin(), sums.end(), ask) - sums.begin();
        if (sums[id].first == need) ans = min(ans, sums[id].second + t);
      }
    }
    if (ans > k)
      cout << "-1\n";
    else
      cout << ans << '\n';
  }
}
