#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, W;
    cin >> N >> W;
    /*
     * dp[i][j]
     * i から始まり、重さが　j 以下であるようなもののうち、
     * 最も利益が高いような取り方
     */
    vector<int> v(N), w(N);
    rep(i, 0, N) cin >> v[i];
    rep(i, 0, N) cin >> w[i];
    vector dp(N, vector<int>(W + 1, -INF));
    {
        vector<int> tmp(W + 1);
        for (int i = N - 1; i >= 0; i--){
            for (int j = W; j >= w[i]; j--){
                dp[i][j] = tmp[j - w[i]] + v[i];
                chmax(tmp[j], tmp[j - w[i]] + v[i]);
            }
        }
    }
    int ind = 0, R = W;
    vector<int> ans;
    while (ind != N && R > 0){
        int val = 0;
        int nx = 0;
        for (int j = N - 1; j >= ind; j--){
            if (chmax(val, dp[j][R])){
                nx = j;
            }
        }
        ind = nx + 1;
        R -= w[nx];
        ans.push_back(nx + 1);
    }
    vec_out(ans, 1);
}