n, m = map(int, input().split())
A = list(map(int, input().split()))
P = list(map(int, input().split()))

DP = [[False for _ in range(m + 1)] for _ in range(n + 1)]
DP[n][0] = True
for i in range(n - 1, -1, -1):
    for j in range(m + 1):
        DP[i][j] = DP[i + 1][j]
    for j in range(A[i], m + 1):
        DP[i][j] |= DP[i + 1][j - A[i]]

if not DP[0][m]:
    print(-1)
    exit()

IDX = [0 for _ in range(n)]
for i in range(n):
    IDX[P[i] - 1] = i

curr = m
ANS = [-1]
while curr > 0:
    for i in range(n):
        if ANS[-1] > IDX[i]:
            continue
        if curr >= A[IDX[i]] and DP[IDX[i] + 1][curr - A[IDX[i]]]:
            ANS.append(IDX[i] + 1)
            curr -= A[IDX[i]]
            break

print(len(ANS) - 1)
print(*ANS[1:])