#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int dp[3010][3001], pre[3010][3010];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, W;
  cin >> n >> W;
  VI v(n), w(n);
  rep(i, n) cin >> v[i];
  rep(i, n) cin >> w[i];
  rep(j, W + 1) pre[n][j] = n;
  rrep(i, n) {
    rep(j, W + 1) {
      if (j >= w[i] && dp[i+1][j-w[i]] + v[i] > dp[i+1][j]) {
        dp[i][j] = dp[i+1][j-w[i]] + v[i];
        pre[i][j] = i;
      } else {
        dp[i][j] = dp[i+1][j];
        pre[i][j] = pre[i+1][j];
      }
    }
  }
  VI ans;
  int i = 0, j = W;
  while (i < n) {
    i = pre[i][j];
    if (i >= n) break;
    ans.emplace_back(i);
    j -= w[i];
    i++;
  }
  cout << ans.size() << '\n';
  rep(i, ssize(ans)) cout << ans[i] + 1 << " \n"[i + 1 == ssize(ans)];
}