#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int N, W; cin >> N >> W;
	vector<int>v(N), w(N);// 価値、重さ
	rep(i, N)cin >> v[i];
	rep(i, N)cin >> w[i];

	vector dp(N + 1, vector<P>(W + 1, { 0,INF }));
	rrep(i, N) {
		rep(j, w[i]) {
			dp[i][j] = dp[i + 1][j];
		}
		rep2(j, w[i], W + 1) {
			if (dp[i + 1][j].first >= dp[i + 1][j - w[i]].first + v[i]) {
				dp[i][j] = dp[i + 1][j];
			}
			else {
				dp[i][j] = { dp[i + 1][j - w[i]].first + v[i],i };
			}
		}
	}
	vector<int>ans;
	int index = dp[0][W].second;
	while (index != INF) {
		ans.push_back(index);
		W -= w[index];
		index = dp[index][W].second;
	}

	cout << ans.size() << endl;
	for (auto e : ans)cout << e + 1 << " ";
	cout << endl;
	return 0;
}