#include <bits/stdc++.h>
using namespace std;
int k1;
int main() {
  int n;
  cin >> n >> k1;
  map<int, int> mp;
  vector<pair<int, int> > vv;
  mp[0] = 0;
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    for (int j = 1; j <= k1; ++j) {
      vv.push_back({x * j, j});
      if (mp.find(x * j) != mp.end()) {
        mp[x * j] = min(mp[x * j], j);
      } else {
        mp[x * j] = j;
      }
    }
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int val;
    int min1 = 10000000;
    scanf("%d", &val);
    for (int j = 0; j < vv.size(); ++j) {
      if (val >= vv[j].first && mp.find(val - vv[j].first) != mp.end()) {
        min1 = min(min1, vv[j].second + mp[val - vv[j].first]);
      }
    }
    if (min1 > k1) min1 = -1;
    printf("%d\n", min1);
  }
  return 0;
}
