#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M;
	cin>>N>>M;
	vector<int> A(N),P(N),rev(N);
	rep(i,N) cin>>A[i];
	rep(i,N) cin>>P[i],P[i]--;
	rep(i,N) rev[P[i]]=i;
	vector<vector<bool>> dp(N+1,vector<bool>(M+1));
	dp[N][0]=1;
	for(int i=N-1;i>=0;i--){
		rep(j,M+1){
			if(dp[i+1][j]){
				dp[i][j]=1;
				if(j+A[i]<=M) dp[i][j+A[i]]=1;
			}
		}
	}
	if(!dp[0][M]){
		cout<<"-1\n";
		return;
	}
	vector<int> ans;
	int val=M;
	int left=0;
	while(val){
		rep(i,N){
			int a=rev[i];
			if(a<left) continue;
			if(val>=A[a]&&dp[a+1][val-A[a]]){
				val-=A[a];
				ans.push_back(a+1);
				left=a+1;
				break;
			}
		}
	}
	cout<<ans.size()<<"\n";
	vec_out(ans);
}