#include <bits/stdc++.h>
using namespace std;
const int MAX = 2e5 + 3;
const long long MOD = 1e9 + 7;
int a[5003];
map<int, int> mp;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  mp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= k; j++) {
      if (mp.find(a[i] * j) == mp.end())
        mp[a[i] * j] = j;
      else
        mp[a[i] * j] = min(mp[a[i] * j], j);
    }
  }
  int q;
  cin >> q;
  while (q--) {
    int x;
    cin >> x;
    int ans = 21;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= k; j++) {
        int baki = x - a[i] * j;
        if (mp.find(baki) != mp.end()) ans = min(ans, j + mp[baki]);
      }
    }
    if (ans > k) ans = -1;
    cout << ans << "\n";
  }
}
