#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define Inf 1000000001



int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<int> a(N);
	rep(i,N)cin>>a[i];
	vector<int> p(N);
	rep(i,N)cin>>p[i];
	
	vector<int> dp(M+1,-Inf);
	dp[0] = N;
	for(int i=N-1;i>=0;i--){
		vector<int> ndp(M+1,-Inf);
		rep(j,M+1){
			ndp[j] = max(ndp[j],dp[j]);
			if(dp[j]!=-Inf){
				if(j+a[i]<=M){
					ndp[j+a[i]] = max(ndp[j+a[i]],i);
				}
			}
		}
		swap(dp,ndp);
	}
	
	if(dp[M]==-Inf){
		cout<<-1<<endl;
		return 0;
	}
	
	vector<int> ans;
	int last = 0;
	//cout<<dp[82-a[12]]<<endl;
	while(M!=0){
		//cout<<M<<endl;
		int ii = last-1;
		for(int i=last;i<N;i++){
			if(M-a[i]>=0 && dp[M-a[i]]>i){
				if(ii==last-1 || p[ii]>p[i])ii = i;
			}
		}
		//cout<<ii<<','<<M<<endl;
		ans.push_back(ii+1);
		M -= a[ii];
		last = ii+1;
	}
	
	cout<<ans.size()<<endl;
	rep(i,ans.size()){
		if(i!=0)cout<<' ';
		cout<<ans[i];
	}
	cout<<endl;
		
	
	return 0;
}