#include <bits/stdc++.h>
using namespace std;
const int INF = numeric_limits<int>::max();
const long long LLINF = numeric_limits<long long>::max();
const unsigned long long ULLINF = numeric_limits<unsigned long long>::max();
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  set<int, greater<int>> s;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    s.insert(a);
  }
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    int best = INF;
    for (auto i = s.lower_bound(x); i != s.end(); i++) {
      if (x / *i > k) break;
      for (int j = 1; j <= x / *i; j++) {
        int xN = x - (*i * j);
        if (!xN) {
          best = min(best, j);
          continue;
        }
        for (int m = 1; m <= k - j; m++) {
          if (xN % m == 0 && s.find(xN / m) != s.end()) {
            best = min(best, j + m);
            break;
          }
        }
      }
    }
    cout << (best <= k ? best : -1) << "\n";
  }
}
