#include <bits/stdc++.h>
#define N 1000011
#define uint unsigned int
#define pii pair<int,int>
#define s1 first
#define s2 second
using namespace std;
const int p=1e9+7;
int n,W;
struct pen{int p,w,id;}a[N];
mt19937 rnd(801);
int v[N],lc[N],rc[N],siz[N],mx[N],sz;uint R[N];
void pushup(int x)
{
	siz[x]=siz[lc[x]]+siz[rc[x]]+1;
	mx[x]=max({mx[lc[x]],mx[rc[x]],v[x]});
}
void split(int x,int V,int &a,int &b)
{
	if(!x){a=b=0;return;}
	if(mx[lc[x]]>V||v[x]>V)b=x,split(lc[x],V,a,lc[x]);
	else a=x,split(rc[x],V,rc[x],b);pushup(x);
}
int merge(int a,int b)
{
	if(!a||!b)return a^b;
	if(R[a]<R[b]){rc[a]=merge(rc[a],b);pushup(a);return a;}
	lc[b]=merge(a,lc[b]);pushup(b);return b;
}
int make(int V){++sz;v[sz]=mx[sz]=V;R[sz]=rnd();lc[sz]=rc[sz]=0;siz[sz]=1;return sz;}
int fac[N],ifac[N];
namespace sgt
{
	pii mn[N*4],mx[N*4];
	void pushup(int x){mn[x]=min(mn[x<<1],mn[x<<1|1]);mx[x]=max(mx[x<<1],mx[x<<1|1]);}
	void build(int L,int R,int x)
	{
		if(L==R)
		{
			mn[x]=pii(a[L].w,L);
			mx[x]=pii(a[L].w,L);
			return;
		}
		build(L,L+R>>1,x<<1);build((L+R>>1)+1,R,x<<1|1);pushup(x);
	}
	pii qmax(int l,int r,int L,int R,int x)
	{
		if(l>r)return pii(-1e9,-1e9);
		if(l<=L&&R<=r)return mx[x];pii ans(-1e9,-1e9);
		if(l<=L+R>>1)ans=max(ans,qmax(l,r,L,L+R>>1,x<<1));if(r>L+R>>1)ans=max(ans,qmax(l,r,(L+R>>1)+1,R,x<<1|1));return ans;
	}
	pii qmin(int l,int r,int L,int R,int x)
	{
		if(l>r)return pii(1e9,1e9);
		if(l<=L&&R<=r)return mn[x];pii ans(1e9,1e9);
		if(l<=L+R>>1)ans=min(ans,qmin(l,r,L,L+R>>1,x<<1));if(r>L+R>>1)ans=min(ans,qmin(l,r,(L+R>>1)+1,R,x<<1|1));return ans;
	}
	void modi(int k,int L,int R,int x)
	{
		if(L==R){mn[x]=pii(1e9,1e9);mx[x]=pii(-1e9,-1e9);return;}
		if(k<=L+R>>1)modi(k,L,L+R>>1,x<<1);else modi(k,(L+R>>1)+1,R,x<<1|1);pushup(x);
	}
};
void ins(int &x,int p)
{
	int P,Q;
	split(x,p,P,Q);
	x=merge(P,merge(make(p),Q));
}
pair<int,int> solve(int L,int R)
{
	auto tt=sgt::qmax(L,R,1,n,1);
	if(tt.s1<0)return pii(1,0);
	int mxi=tt.s2,mni;
	int fr=0;bool all=0;
	vector<int> vp;
	// printf("==================proc[%d,%d]\n",L,R);
	while(1)
	{
		int mni=sgt::qmin(L,R,1,n,1).s2;
		if(mni==mxi){++fr;vp.push_back(a[mni].p);all=1;break;}
		if(a[mni].w+a[mxi].w>W)break;
		// printf("mark %d as free\n",mni);
		sgt::modi(mni,1,n,1);
		++fr;vp.push_back(a[mni].p);
	}
	if(all)
	{
		pii ans;
		ans.s1=fac[fr];
		sort(vp.begin(),vp.end());
		for(int p:vp)ans.s2=merge(ans.s2,make(p));
		return ans;
	}
	else
	{
		pii lc=solve(L,mxi-1),rc=solve(mxi+1,R);
		// printf("[%d,%d] mxi:%d\n",L,R,mxi);
		// printf("lc:%d rc:%d\n",lc.s1,rc.s1);
		pii ans(1,0);
		ans.s1=1ll*lc.s1*rc.s1%p;
		int tot=siz[lc.s2]+siz[rc.s2]+1+vp.size();
		ans.s1=1ll*ans.s1*fac[tot]%p*ifac[tot-vp.size()]%p;
		ans.s2=merge(lc.s2,merge(make(a[mxi].p),rc.s2));
		for(int p:vp)ins(ans.s2,p);
		return ans;
	}
}
void dfs(int u)
{
	if(!u)return;
	dfs(lc[u]);
	printf("%d ",v[u]);
	dfs(rc[u]);
}
inline int qpow(int bs,int ex){int ans=1;while(ex){if(ex&1)ans=1ll*ans*bs%p;ex>>=1;bs=1ll*bs*bs%p;}return ans;}
int main()
{
	fac[0]=1;for(int i=1;i<N;++i)fac[i]=1ll*fac[i-1]*i%p;
	ifac[N-1]=qpow(fac[N-1],p-2);for(int i=N-2;~i;--i)ifac[i]=1ll*ifac[i+1]*(i+1)%p;
	scanf("%d%d",&n,&W);
	for(int i=1;i<=n;++i)scanf("%d",&a[n-i+1].p);
	for(int i=1;i<=n;++i)scanf("%d",&a[n-i+1].w);
	sgt::build(1,n,1);
	pii ans=solve(1,n);
	printf("%d\n",ans.s1);
	dfs(ans.s2);putchar(10);
	fclose(stdin);fclose(stdout);return 0;
}