#include <iostream>
using std::cerr, std::cin, std::cout, std::endl, std::fixed, std::flush;
#include <vector>
using std::vector;
#include <algorithm>
using std::clamp, std::ranges::count, std::ranges::count_if, std::ranges::fill, std::ranges::find, std::ranges::find_if;
using std::ranges::is_permutation, std::ranges::lower_bound, std::ranges::max, std::ranges::max_element, std::ranges::min;
using std::ranges::min_element, std::ranges::next_permutation, std::ranges::prev_permutation, std::swap_ranges;
using std::ranges::reverse, std::ranges::rotate, std::ranges::sort, std::ranges::unique, std::ranges::upper_bound;
static_assert(sizeof(long) == 8);
int main()
{
  int N, W;
  cin >> N >> W;
  vector<int> v(N);
  vector<int> w(N);
  for (int i = 0; i < N; i++)
  {
    cin >> v[i];
  }
  for (int i = 0; i < N; i++)
  {
    cin >> w[i];
  }
  vector<vector<int>> dp(N + 1, vector<int>(W + 1));
  vector<vector<int>> b(N + 1, vector<int>(W + 1));
  for (int i = N - 1; i >= 0; i--)
  {
    for (int j = 0; j <= W; j++)
    {
      dp[i][j] = dp[i + 1][j];
      b[i][j] = j;
    }
    for (int j = 0; j + w[i] <= W; j++)
    {
      if (dp[i][j + w[i]] < dp[i + 1][j] + v[i])
      {
        dp[i][j + w[i]] = dp[i + 1][j] + v[i];
        b[i][j + w[i]] = j;
      }
    }
  }
  int e = max(dp[0]);
  vector<int> ans;
  for (int i = 0; i <= W; i++)
  {
    if (dp[0][i] == e)
    {
      int i0 = i;
      vector<int> tmp;
      for (int j = 0; j < N; j++)
      {
        if (b[j][i0] != i0)
          tmp.push_back(j);
        i0 = b[j][i0];
      }
      if (ans.empty() || tmp < ans)
        ans = move(tmp);
    }
  }

  cout << size(ans) << '\n';
  for (int i = 0; i < size(ans); i++)
  {
    cout << ans[i] + 1 << ' ';
  }
  cout << '\n';
  return 0;
}
/*
  File : ~/kyopro/yukicoder/iwai2/H.cpp
  Date : 2025/08/09
  Time : 14:42:23
*/