#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <limits>
#include <map>
#include <cstdlib>
#include <cmath>
#include <set>
#include <bitset>
#include <string>
#include <iomanip>
#include <deque>
#include <set>

using namespace std;

#define INF 1000001

int main(){
    //freopen("phoneline.in", "r", stdin); freopen("phoneline.out", "w", stdout);
    freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
    ios::sync_with_stdio(false);

    int n, k;
    cin >> n >> k;
    vector<int> m(n);
    vector<int> c(n);

    for(int i = 0; i < n; i++)
        cin >> m[i];

    for(int i = 0; i < n; i++)
        cin >> c[i];

    int last = 0;
    int b[INF], f[INF];

    for(int i = 0; i < INF; i++){
        b[i] = -1;
    }
    b[0] = 0;

    for(int i = 0; i < n; i++){
        for(int j = last; j >= 0; j--){
            if(b[j] != -1){
                if(b[j] + c[i] > b[j+m[i]]){
                    b[j+m[i]] = b[j] + c[i];
                    f[j+m[i]] = i;
                }
                if(j+m[i] > last)
                    last = j+m[i];
            }
        }
    }

    int mi = 0;
    for(int i = 1; i <= k; i++)
        if(b[i] > b[mi])
            mi = i;

    vector<int> ans;
    while(mi != 0){
        ans.push_back(f[mi]+1);
        mi -= m[f[mi]];
    }

    for(int i = (int)ans.size() - 1; i >= 0; i--)
        cout << ans[i] << " ";

    return 0;
}