from bisect import bisect

n, k = map(int, input().split())
c = list(map(int, input().split()))

# dp[i][j] := c[i:]を使って長さj未満の部分列を作る場合の通り数
dp = [[0] + [1] * (k + 1) for _ in range(n + 1)]

for i in reversed(range(n)):
    for j in range(1, k + 2):
        dp[i][j] = dp[i + 1][j] - dp[i + 1][max(j - c[i] - 1, 0)] + dp[i][j - 1]

m = int(input())

for _ in range(m):
    q = int(input()) - 1
    if q >= dp[0][-1] - dp[0][-2]:
        print(-1)
        continue
    res = [0] * n
    remaining = k + 1
    for i in range(n):
        offset = dp[i + 1][max(remaining - c[i] - 1, 0)]
        j = bisect(dp[i + 1], q + offset)
        q -= dp[i + 1][j - 1] - offset
        res[i] = remaining - j
        remaining = j
    print(*res)