#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, q, input, money, temp, ans;
  vector<int> v;
  map<int, int> num;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> input;
    v.push_back(input);
    num.insert(pair<int, int>(input, 0));
  }
  cin >> q;
  for (int i = 0; i < q; i++) {
    cin >> money;
    ans = 1e9;
    for (int j = v.size() - 1; j >= 0; j--) {
      if (money % v[j] == 0 && money / v[j] <= k)
        ans = min(ans, money / v[j]);
      else {
        for (int l = 1; l <= k; l++) {
          temp = money - v[j] * l;
          if (temp < 0) break;
          for (int m = 1; m <= k - l; m++)
            if (temp % m == 0 && num.count(temp / m) != 0)
              ans = min(ans, m + l);
        }
      }
    }
    if (ans != 1e9)
      cout << ans << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}
