#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, k, x, y, q, a[maxn], b[maxn];
unordered_map<int, int> m;
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    for (int j = 1; j <= k; ++j) {
      m[j * a[i]] = j;
    }
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &x);
    int ans = k + 1;
    for (int i = 1; i <= n; ++i) {
      y = a[i];
      for (int j = 1; j <= k; ++j) {
        if (j * y >= x) {
          if (j * y == x) ans = min(ans, j);
          break;
        }
        if (m[x - j * y]) {
          ans = min(ans, j + m[x - j * y]);
        }
      }
    }
    if (ans > k)
      printf("-1\n");
    else
      printf("%d\n", ans);
  }
  return 0;
}
