#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

bool Mst;

const int maxn = 1000100;
const int logn = 21;
const int maxm = 11000100;
const ll mod = 1000000007;

int n, m, a[maxn], p[maxn], ind[maxm], nt, c[maxn], ls[maxn], rs[maxn], stk[maxn], top;
int f[logn][maxn], d[maxn], e[maxn];
ll ans = 1;

struct node {
	int i, p, x;
} b[maxn];

struct graph {
	int nxt[maxm], len, to[maxm * 3], hd[maxm * 3];
	
	inline void add_edge(int u, int v) {
		to[++len] = v;
		nxt[len] = hd[u];
		hd[u] = len;
		++ind[v];
	}
} T;

void cdq(int l, int r) {
	if (l == r) {
		return;
	}
	int mid = (l + r) >> 1;
	cdq(l, mid);
	cdq(mid + 1, r);
	int u = 0;
	// printf("%d %d\n", l, r);
	// for (int i = l; i <= r; ++i) {
		// printf("i: %d %d %d %d\n", i, b[i].i, b[i].p, b[i].x);
	// }
	for (int i = r, j = l; i > mid; --i) {
		while (j <= mid && b[j].x + b[i].x < m) {
			int v = ++nt;
			if (u) {
				T.add_edge(u, v);
			}
			T.add_edge(b[j].i, v);
			u = v;
			++j;
		}
		if (u) {
			T.add_edge(u, b[i].i);
		}
	}
	inplace_merge(b + l, b + mid + 1, b + r + 1, [&](const node &a, const node &b) {
		return a.x < b.x;
	});
}

void dfs(int u) {
	int t = 0;
	if (ls[u]) {
		dfs(ls[u]);
		t += e[ls[u]];
	}
	if (rs[u]) {
		dfs(rs[u]);
		t += e[rs[u]];
	}
	t += (d[u] == u);
	for (int i = 1; i <= e[u]; ++i) {
		ans = ans * (t + i) % mod;
	}
	e[u] += t;
}

void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1, x; i <= n; ++i) {
		scanf("%d", &x);
		p[x] = i;
	}
	for (int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]);
		b[i].i = i;
		b[i].p = p[i];
		b[i].x = m - a[i];
		c[p[i]] = a[i];
	}
	sort(b + 1, b + n + 1, [&](const node &a, const node &b) {
		return a.p > b.p || (a.p == b.p && a.x < b.x);
	});
	for (int i = 1; i <= n; ++i) {
		int k = top;
		while (k && c[stk[k]] < c[i]) {
			--k;
		}
		if (k) {
			rs[stk[k]] = i;
		}
		if (k < top) {
			ls[i] = stk[k + 1];
		}
		stk[++k] = i;
		top = k;
	}
	for (int i = 1; i <= n; ++i) {
		if (ls[i]) {
			f[0][ls[i]] = i;
		}
		if (rs[i]) {
			f[0][rs[i]] = i;
		}
	}
	for (int j = 1; j <= 20; ++j) {
		for (int i = 1; i <= n; ++i) {
			f[j][i] = f[j - 1][f[j - 1][i]];
		}
	}
	for (int i = 1; i <= n; ++i) {
		int p = i;
		for (int j = 20; ~j; --j) {
			if (f[j][p] && c[i] + c[f[j][p]] <= m) {
				p = f[j][p];
			}
		}
		d[i] = p;
		if (i != p) {
			++e[p];
		}
	}
	dfs(stk[1]);
	printf("%lld\n", ans);
	nt = n;
	cdq(1, n);
	priority_queue< int, vector<int>, greater<int> > pq;
	queue<int> q;
	for (int i = 1; i <= nt; ++i) {
		if (!ind[i]) {
			if (i <= n) {
				pq.push(i);
			} else {
				q.push(i);
			}
		}
	}
	while (q.size() || pq.size()) {
		int u;
		if (q.size()) {
			u = q.front();
			q.pop();
		} else {
			u = pq.top();
			pq.pop();
			printf("%d ", u);
		}
		for (int _ = T.hd[u]; _; _ = T.nxt[_]) {
			int v = T.to[_];
			if (!(--ind[v])) {
				if (v <= n) {
					pq.push(v);
				} else {
					q.push(v);
				}
			}
		}
	}
}

bool Med;

int main() {
	fprintf(stderr, "%.2lf MB\n", (&Mst - &Med) / 1048576.);
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}