#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}



int main(){
    ll n,m;cin >> n >> m;
    vl a(n),p(n);
    rep(i,n)cin >> a[i];
    rep(i,n)cin >> p[i];
    vvl dp(n+1,vl(m+1));dp[n][0]=1;
    per(i,n){
        rep(j,m+1){
            if(dp[i+1][j])dp[i][j]=1;
            if(j+a[i]<=m&&dp[i+1][j])dp[i][j+a[i]]=1;
        }
    }
    if(!dp[0][m])cout << -1 << endl,exit(0);
    vl ans;
    ll left=0;
    while(m>0){
        ll midx=-1,val=INF;
        for(ll i=left;i<n;i++){
            if(dp[i][m]==0)break;
            if(m-a[i]<0||dp[i+1][m-a[i]]==0)continue;
            if(chmin(val,p[i]))midx=i;
        }
        ans.emplace_back(midx);
        left=midx+1;
        m-=a[midx];
        //cout << m << endl;
    }
    cout << ans.size() << endl;
    for(auto p:ans)cout << p+1 <<" ";cout << endl;
}