#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>a(n), p(n);
	rep(i, n)cin >> a[i];
	rep(i, n)cin >> p[i];
	reverse(all(a));
	reverse(all(p));
	vector<vector<P>> dp(n + 1, vector<P>(m + 1, { INF,INF }));
	dp[0][0] = { INF - 1,INF - 1 };
	rep(i, n)rep(j, m + 1) {
		if (INF == dp[i][j].first)continue;
		{
			int ni = i + 1;
			int nj = j + 0;
			if (dp[i][j].first < dp[ni][nj].first) {
				dp[ni][nj] = dp[i][j];
			}
		}
		{
			int ni = i + 1;
			int nj = j + a[i];
			if (nj > m) continue;
			if (p[i] < dp[ni][nj].first) {
				dp[ni][nj] = { p[i],i };
			}
		}
	}
	if (INF == dp[n][m].first) {
		cout << -1 << endl;
		return 0;
	}
	vector<int>ans;
	int idx = n;
	int now = m;
	while (now) {
		int val = dp[idx][now].first;
		int pos = dp[idx][now].second;
		cout << val << " " << pos << endl;
		ans.push_back(n - pos);
		now -= a[pos];
		idx = pos;
	}
	cout << ans.size() << endl;
	rep(i, ans.size())cout << ans[i] << " ";
	return 0;
}