#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

int main()
{
  ll N, M;
  cin >> N >> M;
  vector<ll> A(N), P(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> A.at(i);
  }
  for (ll i = 0; i < N; i++)
  {
    cin >> P.at(i);
  }

  vector dp(N + 1, vector(M + 1, false));
  dp.at(N).at(0) = true;
  for (ll i = N; i > 0; i--)
  {
    for (ll j = 0; j <= M; j++)
    {
      if (!dp.at(i).at(j))
        continue;

      dp.at(i - 1).at(j) = true;

      ll nj = j + A.at(i - 1);
      if (nj <= M)
        dp.at(i - 1).at(nj) = true;
    }
  }

  if (!dp.at(0).at(M))
    FINALANS(-1);

  vector<ll> B;
  ll s = M;
  ll tmp = 0;
  while (s > 0)
  {
    ll mn = INF, argmn = -1;
    for (ll i = tmp + 1; i < N; i++)
    {
      if (dp.at(i).at(s) && s - A.at(i) >= 0)
      {
        if (chmin(mn, P.at(i)))
          argmn = i;
      }
    }
    B.push_back(argmn + 1);
    s -= A.at(argmn);
    tmp = argmn;
  }
  //cerr << s << endl;

  cout << B.size() << endl;
  printvec(B);
}