#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
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; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int N, W;
    cin >> N >> W;

    vector<int> v(N), w(N);
    rep(i, N) cin >> v[i];
    rep(i, N) cin >> w[i];

    vector dp(N + 1, vector<int>(W + 1, -INF));
    vector p(N + 1, vector<pii>(W + 1, {-1, -1}));

    dp[N][0] = 0;

    for(int i = N; i > 0; i--){
        for(int j = 0; j <= W; j++){
            if(dp[i][j] == -INF) continue;

            if(dp[i - 1][j] <= dp[i][j]) {
                dp[i - 1][j] = dp[i][j];
                chmax(p[i - 1][j], {i, j});
            }
            if(j + w[i - 1] <= W && dp[i - 1][j + w[i - 1]] <= dp[i][j] + v[i - 1]) {
                dp[i - 1][j + w[i - 1]] = dp[i][j] + v[i - 1];
                chmax(p[i - 1][j + w[i - 1]], {i, j});
            }
        }
    }


    int mx = *max_element(all(dp[0]));
    vector<int> ans;
    rep(z, W + 1){
        if(dp[0][z] != mx) continue;

        int j = z;
        vector<int> ret;
        rep(i, N){
            auto [ni, nj] = p[i][j];
            if(nj != j) ret.push_back(i);
            j = nj;
        }

        chmax(ans, ret);
    }
    debug(ans);

    int m = ans.size();
    cout << m << endl;
    rep(i, m) cout << ans[i] + 1 << (i == m - 1 ? "\n" : " ");
}