/* -*- coding: utf-8 -*-
 *
 * 1872.cc:  No.1872 Dictionary Order - yukicoder
 */

#include<cstdio>
#include<algorithm>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 2000;
const int MAX_M = 2000;
const int INF = 1 << 30;

/* typedef */

typedef pair<int,int> pii;

/* global variables */

int as[MAX_N], ps[MAX_N], bs[MAX_N];
pii dp[MAX_N + 1][MAX_M + 1];

/* subroutines */

inline void setmin(pii &a, pii b) { if (a > b) a = b; }

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", as + i);
  for (int i = 0; i < n; i++) scanf("%d", ps + i);

  for (int i = 0; i <= n; i++)
    fill(dp[i], dp[i] + m + 1, pii(INF, -1));
  dp[n][0] = pii(INF, 0);

  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j <= m; j++)
      if (dp[i + 1][j].second >= 0)
	dp[i][j] = pii(dp[i + 1][j].first, j);

    int ai = as[i];
    for (int j = 0; j + ai <= m; j++)
      if (dp[i + 1][j].second >= 0)
	setmin(dp[i][j + ai], pii(ps[i], j));
  }

  if (dp[0][m].second < 0) puts("-1");
  else {
    int k = 0;
    for (int i = 0, j = m; i < n; i++) {
      pii p = dp[i][j];
      if (p.second != j) {
	bs[k++] = i;
	j = p.second;
      }
    }

    printf("%d\n", k);
    for (int i = 0; i < k; i++)
      printf("%d%c", bs[i] + 1, (i + 1 < k) ? ' ' : '\n');
  }
  return 0;
}