#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  REP(i, N) cin >> A[i];
  vector<int> P(N);
  REP(i, N) cin >> P[i];
  vector<vector<int>> dp(N+1, vector<int>(M+1, 1e9));
  dp[N][M] = -1;
  IREP(i, N) REP(j, M+1) if(dp[i+1][j] != 1e9) {
    chmin(dp[i][j], dp[i+1][j]);
    if(j-A[i] >= 0) chmin(dp[i][j-A[i]], P[i]);
  }
  if(dp[0][0] == 1e9) {
    cout << -1 << endl;
    return 0;
  }
  vector<int> ans;
  int x = 0;
  int y = 0;
  while(dp[x][y] != -1) {
    if(P[x] == dp[x][y]) {
      ans.push_back(x+1);
      y += A[x];
    }
    x++;
  }
  cout << ans.size() << endl;
  REP(i, ans.size()) cout << ans[i] << (i!=ans.size()-1 ? " " : "");
  cout << "\n";
}