#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

const int inf = 1e9;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, m; cin >> n >> m;
    vector<int> a(n), p(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++) {
        cin >> p[i];
        p[i]--;
    }
    auto dp = vec2d(n+1, m+1, false);
    auto pre = vec2d(n+1, m+1, inf);
    auto pre_idx = vec2d(n+1, m+1, -1);
    dp[n][0] = true;
    pre[n][0] = -1;
    pre_idx[n][0] = -1;
    for(int i = n-1; i >= 0; i--){
        for(int j = 0; j <= m; j++){
            if(!dp[i+1][j]) continue;
            dp[i][j] = true;
            if(chmin(pre[i][j], pre[i+1][j])){
                pre_idx[i][j] = pre_idx[i+1][j];
            }
            if(j+a[i] <= m) {
                dp[i][j+a[i]] = true;
                if(chmin(pre[i][j+a[i]], p[i])){
                    pre_idx[i][j+a[i]] = i+1;
                }
            }
        }
    }
    if(!dp[0][m]){
        cout << -1 << endl;
        return 0;
    }
    int idx = pre_idx[0][m];
    int rem = m;
    vector<int> ans;
    while(idx != -1){
        ans.push_back(idx-1);
        rem -= a[idx-1];
        idx = pre_idx[idx][rem];
    }
    cout << ans.size() << endl;
    for(int x: ans) cout << x+1 << ' ';
    cout << endl;
}