import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; const M = readInt; auto A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt; } auto P = new int[N]; foreach (i; 0 .. N) { P[i] = readInt - 1; } auto Q = new int[N]; foreach (i; 0 .. N) { Q[P[i]] = i; } // tail auto dp = new int[M + 1]; dp[] = -1; dp[0] = N; foreach_reverse (i; 0 .. N) { foreach_reverse (x; 0 .. M - A[i] + 1) { if (dp[x] >= i + 1) { chmax(dp[x + A[i]], i); } } } if (dp[M] >= 0) { int[] ans; int pos; int m = M; for (; m > 0; ) { foreach (j; 0 .. N) { const i = Q[j]; if (i >= pos && m - A[i] >= 0 && dp[m - A[i]] >= i + 1) { ans ~= i; pos = i + 1; m -= A[i]; goto found; } } assert(false); found: } writeln(ans.length); foreach (index, i; ans) { if (index) write(" "); write(i + 1); } writeln; } else { writeln(-1); } } } catch (EOFException e) { } }