#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int N=1e6+5,P=1e9+7;
int n,W,ans=1;
vector<int>G[N];
set<pair<int,int>>Y;
vector<pair<int,int>>X;
priority_queue<int,vector<int>,greater<int>>Q;
int p[N],q[N],a[N],A[N],st[N],L[N],R[N],d[N];
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>W;
	for(int i=1;i<=n;++i)cin>>p[i],q[p[i]]=i;
	for(int i=1;i<=n;++i)cin>>a[i];
	for(int i=1;i<=n;++i)A[i]=a[i];
	for(int i=1,top=0;i<=n;++i)
		if(A[i]<=W/2){
			int z=0;
			for(int l=1,r=top;l<=r;){
				const int mid=(l+r)>>1;
				if(A[st[mid]]+A[i]>W)z=mid,l=mid+1;
				else r=mid-1;
			}
			if(z)L[i]=st[z];
			else L[i]=0;
		}
		else{
			for(;top&&A[st[top]]<=A[i];--top);
			st[++top]=i;
		}
	for(int i=n,top=0;i>=1;--i)
		if(A[i]<=W/2){
			int z=0;
			for(int l=1,r=top;l<=r;){
				const int mid=(l+r)>>1;
				if(A[st[mid]]+A[i]>W)z=mid,l=mid+1;
				else r=mid-1;
			}
			if(z)R[i]=st[z];
			else R[i]=n+1;
		}
		else{
			for(;top&&A[st[top]]<=A[i];--top);
			st[++top]=i;
		}
	Y.emplace(0,0);
	for(int i=1;i<=n;++i)
		if(A[i]<=W/2)X.emplace_back(L[i],R[i]);
		else Y.emplace(i,1);
	Y.emplace(n+1,1);
	sort(X.begin(),X.end(),[&](pair<int,int>x,pair<int,int>y){
		return x.second-x.first<y.second-y.first;
	});
	for(auto [l,r]:X){
		int c=0;
		auto itl=next(Y.lower_bound(make_pair(l,-1))),itr=itl;
		while(itr!=Y.end()&&itr->first<=r)c+=itr->second,++itr;
		Y.erase(itl,itr);
		ans=1ll*ans*c%P;
		Y.emplace(r,c+1);
	}
	cout<<ans<<'\n';
	for(int i=1,j=0;i<=n;++i)
		if(A[i]<=W/2){
			if(L[i]>=1)G[q[i]].emplace_back(q[L[i]]);
			if(R[i]<=n)G[q[R[i]]].emplace_back(q[i]);
		}
		else{
			if(j)G[q[i]].emplace_back(q[j]);
			j=i;
		}
	for(int i=1;i<=n;++i)for(auto j:G[i])++d[j];
	for(int i=1;i<=n;++i)if(!d[i])Q.emplace(i);
	for(int i=1;i<=n;++i){assert(!Q.empty());
		int u=Q.top();Q.pop();
		cout<<u<<" \n"[i==n];
		for(auto v:G[u])if(!--d[v])Q.emplace(v);
	}
	return 0;
}
/*
*/