#include <bits/stdc++.h>
using namespace std;

bitset<2001> dp[2001];

int main() {
    int N,M;
    cin >> N >> M;
    vector<int>A(N),P(N),Q(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for(int i = 0; i < N; i++) {
        cin >> P[i];
        Q[P[i]-1] = i;
    }
    dp[N][0] = 1;
    for(int i = N-1; i >= 0; i--) {
        dp[i] = dp[i+1]|(dp[i+1] << A[i]);
    }
    if(!dp[0][M]) {
        cout << -1 << endl;
        return 0;
    }
    vector<int>ans,tmp(N);
    ans.push_back(-1);
    for(int i = 0; i < N; i++) {
        tmp[i] = Q[i];
    }
    int now = M;
    while (now != 0) {
        vector<int>nxt;
        bool flag = false;
        for(int i = 0; i < tmp.size(); i++) {
            if(ans.back() < tmp[i] && now >= A[tmp[i]]) {
                nxt.push_back(tmp[i]);
                if(dp[tmp[i]+1][now-A[tmp[i]]] && !flag) {
                    ans.push_back(tmp[i]);
                    now -= A[tmp[i]];
                    flag = true;
                }
            }
        }
        tmp = nxt;
    }
    ans.erase(ans.begin());
    cout << ans.size() << endl;
    for(int i = 0; i < ans.size(); i++) {
        cout << ans[i]+1 << ((i+1 == ans.size())?"\n":" ");
    }
}