#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,W;
int A[3030],B[3030];

pair<int,int> dp[3030][3030];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>W;
	FOR(i,N) cin>>A[i];
	FOR(i,N) cin>>B[i];
	FOR(i,W+1) dp[N][i]={0,N};
	
	for(i=N-1;i>=0;i--) {
		FOR(j,W+1) {
			dp[i][j]=dp[i+1][j];
			if(j>=B[i]&&dp[i][j].first<dp[i+1][j-B[i]].first+A[i]) {
				dp[i][j]={dp[i+1][j-B[i]].first+A[i],i};
			}
		}
	}
	vector<int> ret;
	int cur=0;
	while(cur<N) {
		cur=dp[cur][W].second;
		if(cur>=N) break;
		ret.push_back(cur+1);
		W-=B[cur];
		cur++;
	}
	cout<<ret.size()<<endl;
	FORR(a,ret) cout<<a<<" ";
	cout<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}