#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int n, k, q, a[5500];
map<int, int>::iterator it;
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 1; j <= k; ++j) {
      int z = a[i] * j;
      if (mp[z] == 0)
        mp[z] = j;
      else
        mp[z] = min(mp[z], j);
    }
  }
  scanf("%d", &q);
  for (int i = 0; i < q; ++i) {
    int x;
    scanf("%d", &x);
    int ans = 100;
    for (it = mp.begin(); it != mp.end(); ++it) {
      int s = (it)->first;
      int kk = (it)->second;
      int t = 0;
      if (mp.find(x - s) != mp.end()) t = mp[x - s];
      if (s < x && t != 0) {
        ans = min(ans, kk + t);
        continue;
      }
      if (s == x) ans = (min(ans, kk));
    }
    if (ans <= k)
      printf("%d\n", ans);
    else
      printf("%d\n", -1);
  }
  return 0;
}
