#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline)) static
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;
using ll = long long;

#define IC isdigit(c)
#define GC c=getchar()
void rd(auto &x) { x = 0; char GC; bool f = 0;
	for (; !IC; GC) f |= c == '-';
	for (; IC; GC) x = x * 10 + c - 48;
	if (f) x = -x;
}
void rd(auto &x, auto &...y) { rd(x); rd(y...); }
#define meow(...) fprintf(stderr, __VA_ARGS__)
#define Assert(e) if (!(e)) { meow("AF@%d\n", __LINE__); exit(__LINE__); }

#define vc vector
#define pb push_back
#define eb emplace_back

const int N = 1000006;
const ll P = 1000000007;
ll fac[N], ifac[N];
ll qpow(ll x, ll t = P - 2) { ll v = 1;
	for (; t; (x *= x) %= P, t >>= 1) if (t & 1)
		(v *= x) %= P;
	return v;
}
void gen() {
	fac[0] = 1; U (i, 1, N - 1) fac[i] = fac[i - 1] * i %P;
	ifac[N - 1] = qpow(fac[N - 1]);
	D (i, N - 1, 1) ifac[i - 1] = ifac[i] * i %P;
}

int n, m, W, w[N], a[N], ls[N];

int ch[N][2], rt;
void cat() {
	int stk[N] {}, sp = 0;
	U (i, 1, n) {
		while (sp && w[a[i]] >= w[a[stk[sp]]]) --sp;
		ch[i][0] = stk[sp + 1];
		if (sp) ch[stk[sp]][1] = i;
		stk[++sp] = i;
		stk[sp + 1] = 0;
	}
	rt = stk[1];
}
int fa[N][20];
void dfs(int u, int f) {
	fa[u][0] = f;
	U (k, 1, 19) fa[u][k] = fa[fa[u][k - 1]][k - 1];
	for (int v : ch[u]) if (v) {
		dfs(v, u);
	}
}

bool fix[N];
int rf[N]; vc<int> op[N];
ll ans = 1; int p[N], ptr;
int siz[N];
set<int> pq;

void dfs2(int u) {
	for (int i : op[u]) pq.insert(a[i]);
	siz[u] = fix[u];
	if (ch[u][1]) dfs2(ch[u][1]), siz[u] += siz[ch[u][1]];
	if (fix[u]) {
		while (pq.size() && *pq.begin() < a[u])
			p[++ptr] = *pq.begin(), pq.erase(pq.begin());
		p[++ptr] = a[u];
	}
	if (ch[u][0]) dfs2(ch[u][0]), siz[u] += siz[ch[u][0]];
	
	vc<int> tmp;
	for (int i : op[u]) if (pq.find(a[i]) != pq.end()) tmp.pb(a[i]);
	sort(tmp.begin(), tmp.end());
	for (int x : tmp) {
		p[++ptr] = x;
		pq.erase(x);
	}

	(ans *= fac[siz[u] + op[u].size()] * ifac[siz[u]] %P) %= P;
	siz[u] += op[u].size();
}
int main() {
	// freopen("ava.in", "r", stdin);
	// freopen(".out", "w", stdout);
	gen();

	rd(n, W);
	U (i, 1, n) rd(a[i]);
	U (i, 1, n) rd(w[i]);
	// U (i, 1, n) rd(w[i]), ls[i] = w[i];
	// sort(ls + 1, ls + n + 1); m = unique(ls + 1, ls + n + 1) - ls - 1;
	// U (i, 1, n) w[i] = lower_bound(ls + 1, ls + m + 1, w[i]) - ls;
	
	cat();
	dfs(rt, 0);

	U (i, 1, n) {
		int u = i;
		D (k, 19, 0) {
			int v = fa[u][k]; if (!v) continue;
			if (w[a[i]] + w[a[v]] <= W)
				u = v;
		}
		if (u == i) {
			fix[u] = 1;
		} else {
			op[u].pb(i);
		}
	}
	
	dfs2(rt);
	printf("%lld\n", ans);
	assert(!pq.size());
	// while (pq.size())
	// 	p[++ptr] = pq.top(), pq.pop();
	U (i, 1, n)
		printf("%d ", p[i]);
	puts("");
}