#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<pair<long long, int> > p;
  for (int i = 1; i <= k; i++) {
    for (int j = 0; j < n; j++) {
      p.push_back({1LL * i * a[j], i});
    }
  }
  sort(p.begin(), p.end());
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    long long x;
    cin >> x;
    int ans = INT_MAX;
    for (int j = 0; j < (int)p.size(); j++) {
      long long rest = x - p[j].first;
      if (rest < 0) {
        break;
      }
      if (rest == 0) {
        ans = min(ans, p[j].second);
      } else {
        int pos =
            lower_bound(p.begin(), p.end(), make_pair(rest, 0)) - p.begin();
        if (pos != (int)p.size() && p[pos].first == rest &&
            p[j].second + p[pos].second <= k) {
          ans = min(ans, p[pos].second + p[j].second);
        }
      }
    }
    if (ans == INT_MAX)
      cout << -1 << "\n";
    else
      cout << ans << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
  return 0;
}
