#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, M;
	cin >> N >> M;
	vi v(N), w(N);
	vin(v);
	vin(w);

	lint a=0, b=0, c=0, x, y, z;
	vvi dp(N+1, vi(M+1));
	dp[0][0] = 1;
	reverse(all(v));
	rep(i, N) {
		rep(j, M+1) {
			chmax(dp[i+1][j], dp[i][j]);
			if (j+v[i] <= M) chmax(dp[i+1][j+v[i]], dp[i][j]);
		}
	}
	if (dp[N][M] != 1) drop(-1);
	reverse(all(v));
	reverse(all(dp));
	queue<lint> q;
	rep(t, N) {
		a = LINF;
		repx(i, t, N) {
			if (b+v[i] <= M && dp[i+1][M-b-v[i]]) {
				if (chmin(a, w[i])) t = i;
			}
		}
		q.push(t+1);
		b += v[t];
		if (b == M) break;
	}
	std::cout << q.size() << '\n';
	while (!q.empty()) {
		std::cout << q.front() << ' ';
		q.pop();
	}
	cout << endl;
}