#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
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>;
using BS = bitset<2010>;
BS dp[2010];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI a(n);
  rep(i, n) cin >> a[i];
  VI p(n);
  rep(i, n) cin >> p[i], p[i]--;
  dp[n][0] = true;
  rrep(i, n) dp[i] = dp[i + 1] | (dp[i + 1] << a[i]);
  if (!dp[0][m]) {
    cout << -1 << '\n';
    return 0;
  }
  VI pinv(n);
  rep(i, n) pinv[p[i]] = i;
  VI ans;
  int last = -1;
  while(m) {
    for(int i: pinv) if (i > last && a[i] <= m && dp[i+1][m - a[i]]) {
      ans.emplace_back(i);
      m -= a[i];
      last = i;
      break;
    }
  }
  int k = ans.size();
  cout << k << '\n';
  rep(i, k) cout << ans[i] + 1 << " \n"[i + 1 == k];
}