N, M = list(map(int, input().split()))
W = list(map(int, input().split()))
P = list(map(int, input().split()))
A = [[0] * (M + 1) for i in range(N + 1)]
for i in range(1, N + 1):
    for j in range(1, M + 1):
        if W[i - 1] > j:
            A[i][j] = A[i - 1][j]
        else:
            A[i][j] = max(A[i - 1][j], P[i - 1] + A[i - 1][j - W[i - 1]])
i = N
j = M
R = []
while i != 0:
    if A[i][j] > A[i - 1][j]:
        R.append(i)
        j -= W[i - 1]
    i -= 1
for i in sorted(R):
    print(i)