#include <bits/stdc++.h>
using namespace std;
int n, m, q, x, ans, i, j, k, l, a[5005];
map<int, int> mp;
int main() {
  cin >> n >> m;
  mp[0] = 0;
  for (i = 1; i <= n; ++i) {
    cin >> a[i];
    for (j = 1; j <= m; ++j) {
      if (mp.count(j * a[i]) > 0)
        mp[j * a[i]] = min(mp[j * a[i]], j);
      else
        mp[j * a[i]] = j;
    }
  }
  cin >> q;
  while (q--) {
    cin >> x;
    ans = 1e9;
    for (i = 1; i <= n; ++i) {
      for (j = 1; j <= m; ++j) {
        if (mp.count(x - j * a[i]) > 0) {
          ans = min(ans, j + mp[x - j * a[i]]);
        }
      }
    }
    cout << (ans > m ? -1 : ans) << endl;
  }
  return 0;
}
