import sys
input = sys.stdin.readline
N, W = map(int, input().split())
v = list(map(int, input().split()))
w = list(map(int, input().split()))
v.reverse()
w.reverse()
dp = [[-1 for _ in range(W+1)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
    for j in range(W+1):
        if dp[i][j]==-1:
            continue
        dp[i+1][j] = max(dp[i+1][j], dp[i][j])
        if j+w[i]<=W:
            dp[i+1][j+w[i]] = max(dp[i+1][j+w[i]], dp[i][j]+v[i])
now = []
max_val = -1
for i in range(W+1):
    if max_val<dp[N][i]:
        max_val = dp[N][i]
        now = [i]
    elif max_val==dp[N][i]:
        now.append(i)
ans = None
for nw in now:
    tmp = []
    for i in range(N, 0, -1):
        vv = v[i-1]
        ww = w[i-1]
        if dp[i-1][nw]==dp[i][nw]:
            pass
        elif nw-ww>=0 and dp[i-1][nw-ww]==dp[i][nw]-vv:
            tmp.append(N-i+1)
            nw-=ww
    if ans is None:
        ans = tmp
    elif ans<tmp:
        ans = tmp
print(len(ans))
print(*ans)