#include <bits/stdc++.h>
using namespace std;
int n, k;
int cash[5555];
set<int> st;
void doit(int y) {
  int ans = 1e9;
  for (int i = 0; i < n; i++) {
    for (int j = 1; j <= k; j++) {
      int num = y - cash[i] * j;
      if (num == 0) {
        ans = min(ans, j);
        break;
      }
      if (num < 0) break;
      for (int d = 1; d + j <= k; d++) {
        if (num % d != 0) {
          continue;
        } else {
          int zhang = num / d;
          if (st.count(zhang) != 0) {
            ans = min(ans, j + d);
          }
        }
      }
    }
  }
  if (ans <= k) {
    cout << ans << endl;
  } else {
    cout << -1 << endl;
  }
}
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> cash[i];
    st.insert(cash[i]);
  }
  int q;
  cin >> q;
  while (q--) {
    int xi;
    cin >> xi;
    doit(xi);
  }
  return 0;
}
