#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int M = 2000;
  int n, m; cin >> n >> m;
  vector<int> a(n), p(n);
  REP(i, n) cin >> a[i];
  REP(i, n) cin >> p[i];
  vector<bitset<M + 1>> dp(n + 1, 0);
  dp[n].set(0);
  for (int i = n - 1; i >= 0; --i) {
    dp[i] = dp[i + 1] | (dp[i + 1] << a[i]);
  }
  if (!dp[0][m]) {
    cout << "-1\n";
    return 0;
  }
  vector<int> ord(n);
  iota(ALL(ord), 0);
  sort(ALL(ord), [&](int l, int r) -> bool { return p[l] < p[r]; });
  int r = -1;
  vector<int> ans;
  while (m > 0) {
    for (int i : ord) {
      if (r < i && m >= a[i] && dp[i][m] && dp[i + 1][m - a[i]]) {
        ans.emplace_back(i);
        m -= a[i];
        r = i;
        break;
      }
    }
  }
  const int k = ans.size();
  cout << k << '\n';
  REP(i, k) cout << ans[i] + 1 << " \n"[i + 1 == k];
  return 0;
}