#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;


void solve(){
    ll n,m;cin>>n>>m;
    vector<ll>a(n),p(n);
    rep(i,n)cin>>a[i];
    rep(i,n)cin>>p[i];
    vector<vector<ll> >dp(n+1,vector<ll>(m+1));
    dp[0][0]=1;
    reverse(all(a));
    rep(i,n){
        rep(j,m+1){
            if(dp[i][j]==0)continue;
            dp[i+1][j]=1;
            if(j+a[i]>m)continue;
            dp[i+1][j+a[i]]=1;
        }
    }
    if(dp[n][m]==0){
        cout<<-1<<endl;
        return;
    }
    reverse(all(a));
    reverse(all(dp));
    vector<ll>c(n);
    rep(i,n){
        p[i]--;
        c[p[i]]=i;
    }
    vector<ll>b(0);
    ll now=m;
    ll la=-1;
    while(now>0){
        rep(i,n){
            if(la>=c[i])continue;
            if(a[c[i]]<=now&&dp[c[i]][now]&&dp[c[i]+1][now-a[c[i]]]){
                now-=a[c[i]];
                b.pb(c[i]);
                la=c[i];
                break;
            }
        }
    }
    cout<<b.size()<<endl;
    rep(i,b.size()){
        cout<<b[i]+1<<' ';
    }
    cout<<endl;
}

signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}