#include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return (a < b) ? a : b; }
int main() {
  int n, k;
  cin >> n >> k;
  int *a = new int[n];
  map<int, int> myMap;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    for (int j = 1; j <= k; j++) {
      if (myMap.find(a[i] * j) == myMap.end()) {
        myMap[a[i] * j] = j;
      } else {
        myMap[a[i] * j] = min(myMap[a[i] * j], j);
      }
    }
  }
  int q, x, m, tmpMyMap;
  cin >> q;
  map<int, int>::iterator itMyMap;
  for (int t = 0; t < q; t++) {
    m = -1;
    cin >> x;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j <= k; j++) {
        if (x < a[i] * j) {
          break;
        }
        itMyMap = myMap.find(x - a[i] * j);
        if (itMyMap != myMap.end()) {
          tmpMyMap = (*itMyMap).second;
          if (tmpMyMap + j <= k) {
            if (m == -1 || m > tmpMyMap + j) {
              m = tmpMyMap + j;
            }
          }
        }
      }
    }
    cout << m << endl;
  }
  return 0;
}
