N,M = map(int,input().split())
A = list(map(int,input().split()))
P = list(map(int,input().split()))
board = []
for i in range(N):
    board.append((P[i],i))
board.sort(key=lambda x:x[0])
dp = [[False] * (M+1) for _ in range(N)]
dp[N-1][0] = True
dp[N-1][A[-1]] = True
for i in reversed(range(1,N)):
    for m in range(M+1):
        if dp[i][m]:
            if m + A[i-1] <= M:
                dp[i-1][m + A[i-1]] = dp[i][m]
            dp[i-1][m] = dp[i][m]
cur = - 1
ANS = []
while M:
    for p,index in board:
        if index+1 < N and M-A[index] >= 0 and dp[index+1][M-A[index]] and cur < index:
            ANS.append(index)
            M-=A[index]
            cur = index
            break
        elif index == N -1:
            if dp[index][M]:
                ANS.append(index)
                M-= A[index]
                break
    else:
        break
if ANS == []:
    print(-1)
else:
    print(len(ANS))
    print(*list(map(lambda x:x+1,ANS)))