#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
map<int, int> d[25];
int a[5005];
int main() {
  int n, k, i, j, f;
  scanf("%d %d", &n, &k);
  for (i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    for (j = 0; j <= k; ++j) {
      d[j][a[i] * j] = 1;
    }
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int x, ans = -1;
    scanf("%d", &x);
    for (i = 1; i <= n; ++i) {
      int cans = -1;
      for (j = 1; j <= k; ++j) {
        for (f = 1; f <= j; ++f) {
          int sum = a[i] * f;
          if (d[j - f].count(x - sum)) {
            cans = j;
            break;
          }
        }
        if (cans != -1) break;
      }
      if (cans != -1 && (cans < ans || ans == -1)) {
        ans = cans;
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
