#include<bits/stdc++.h>
using namespace std;using ll=long long;using i128=__int128;using ull=unsigned long long;using ld=long double;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pdd=pair<ld,ld>;
const int M=1e9+7,N=1e6+10;const ll inf=1e17;const ld eps=1e-10;
clock_t ct;bool ot;int tct=0;
void oT(char c='.'){cout<<c<<"Time:"<<double(clock()-ct)<<'\n';}
struct calcC{//precal needed
	ll poww(ll bs,ll x){ll res=1;for(bs=(bs%M+M)%M;x;x>>=1,(bs*=bs)%=M)if(x&1)(res*=bs)%=M;return res;}
	ll invv(ll bs){return poww(bs,M-2);}vector<ll>mul,inv;
	void precal(int P){mul.resize(P+1);mul[0]=1;for(int i=1;i<=P;i++)mul[i]=mul[i-1]*i%M;
		inv.resize(P+1);inv[P]=invv(mul[P]);for(int i=P;i;i--)inv[i-1]=inv[i]*i%M;}
	ll C(int n,int m){if(n<m||m<0)return 0;return mul[n]*inv[m]%M*inv[n-m]%M;}
	ll A(int n,int m){if(n<m||m<0)return 0;return mul[n]*inv[n-m]%M;}
}xC;
struct S
{	
	int n,lim,pt=0;set<int>xS;ll res=1;
	vector<int>h,l,r,f,rk,toseg;vector<vector<int>>es,sd,spe;
	vector<int>cc;
	void Ade(int u,int v)
	{
		u=rk[u],v=rk[v];
		//cout<<u<<"->"<<v<<'\n';
		spe[u].push_back(v);cc[v]++;
	}
	void gnew(int u,int _l,int _r)
	{
		es[u].push_back(++pt);f[pt]=u;
		l[pt]=_l;r[pt]=_r;toseg[_r]=pt;
	}
	int spr(int x)
	{
		sort(es[x].begin(),es[x].end(),[&](int a,int b){return r[a]<r[b];});	
		int esz=es[x].size();
		if(esz)
		{		
			//for(int i=0;i<esz-1;i++)if(r[es[x][i]]^l[es[x][i+1]])			
			{
				//cout<<x<<'/'<<l[x]<<','<<r[x]<<'\n';
				//exit(1);
			}
			if(l[es[x][0]]!=l[x])
			{
				int y=es[x][0];
				cout<<x<<'/'<<l[x]<<','<<r[x]<<"(L)"<<y<<'/'<<l[y]<<','<<r[y]<<"\n";
			}
			if(r[es[x].back()]!=r[x])
			{
				int y=es[x].back();
				cout<<x<<'/'<<l[x]<<','<<r[x]<<"(R)"<<y<<'/'<<l[y]<<','<<r[y]<<"\n";
			}
		}
		int spz=sd[x].size(),siz=bool(es[x].size());for(auto&k:es[x])siz+=spr(k);siz+=spz;
		//cout<<x<<":"<<"["<<l[x]<<","<<r[x]<<"]"<<"&"<<f[x]<<"&"<<siz<<'/'<<spz<<"\n";
		(res*=xC.A(siz,spz))%=M;return siz;
	}
	void ini()
	{
		cin>>n>>lim;vector<int>g(n+2,0);l=r=f=toseg=rk=h=cc=g;es.resize(n+2);sd=spe=es;
		for(int i=n,x;i;i--)cin>>rk[i];for(int i=1;i<=n;i++)cin>>g[i];
		for(int i=n,x;i;i--)x=rk[i],h[i]=g[x];h[0]=h[n+1]=M;
		//cout<<"rk:";for(int i=1;i<=n;i++)cout<<rk[i]<<".\n"[i==n];
		//cout<<"h:";for(int i=1;i<=n;i++)cout<<h[i]<<".\n"[i==n];
		pt=0;l[0]=rk[0]=0,r[0]=rk[n+1]=n+1,f[0]=0;xS.insert(0);xS.insert(n+1);toseg[n+1]=0;
		for(int i=1,lst=0;i<=n+1;i++)if(h[i]*2>lim)Ade(lst,i),lst=i;
		priority_queue<pii>Q;
		for(int i=1,lst=0;i<=n;i++)
		{
			if(h[i]*2<=lim)Q.push({(lim-h[i])*2+1,i});
			else Q.push({h[i]*2,i});
		}
		while(!Q.empty())
		{
			auto[_,x]=Q.top();Q.pop();int sp=abs(_)&1;
			
			auto ite=xS.lower_bound(x);int rd=*ite,sg=toseg[rd];
			//cout<<x<<"^"<<sp<<','<<rd<<'/'<<sg<<'\n';
			if(sp){sd[sg].push_back(x);Ade(x,rd);Ade(*--ite,x);continue;}
			xS.insert(x);gnew(sg,l[sg],x),gnew(sg,x,r[sg]);
		}
		spr(0);cout<<res<<"\n";
	}
	void solve()
	{
		priority_queue<int>Q;Q.push(0);vector<int>res;
		while(!Q.empty())
		{
			auto x=Q.top();Q.pop();x=-x;res.push_back(x);
			for(auto&k:spe[x])if(!--cc[k])Q.push(-k);
		}
		for(int i=1;i<=n;i++)cout<<res[i]<<" \n"[i==n];
	}
};
void precal(){xC.precal(N);}
int main()
{
	//freopen("1.in","r",stdin);
	//cout<<fixed<<setprecision(12);
	ct=clock();
	ios::sync_with_stdio(0);cin.tie(0);precal();
	int t=1;//cin>>t;
	//clock_t a=clock();
	while(t--){tct++;S SS;SS.ini();SS.solve();}
	//cout<<"Time:"<<double(clock()-a)<<'\n';
}