#include <bits/stdc++.h>
using namespace std;
#define pb push_back

const int N=1e6+5,H=1e9+7;
int n,p[N],a[N],ans=1,ls[N],rs[N],W,st[N],tp=0,fa[N],id[N],sz[N],pre[N],Ans[N],cnt=0,b[N];
vector<int> G[N][2];
priority_queue<int> Q;
set<int> S[N];
bool vis[N];

int mul(int a,int b){return 1ll*a*b%H;}

int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}

void merge(int u,int v){
  if(!u||!v) return;
  u=find(u),v=find(v);
  if(u!=v) fa[v]=u;
}

void dfs1(int u,int lst){
  int szlc=0,szrc=0;S[lst].insert(b[u]);
  for(auto v:G[u][0]) dfs1(v,u),szlc+=sz[v];
  for(int i=0;i<(int)G[u][0].size()-1;i++) ans=mul(ans,szlc-i);
  for(auto v:G[u][1]) dfs1(v,lst),szrc+=sz[v];
  for(int i=0;i<(int)G[u][1].size()-1;i++) ans=mul(ans,szrc-i);
  sz[u]=szlc+szrc+1;
}

void dfs2(int u){
  if(G[u][0].empty()&&G[u][1].empty()) return;
  int ct=0;
  for(auto v:G[u][0]) if(G[v][0].empty()&&G[v][1].empty()) Q.push(-b[v]),++ct;
  assert(G[u][0].size()-ct<=1);
  
  for(auto v:G[u][0]) dfs2(v);
  while(!Q.empty()&&-Q.top()<=b[u]){
	int tmp=-Q.top();Q.pop();
	if(!vis[tmp]) vis[tmp]=1,Ans[++cnt]=tmp;
  }
  for(auto i:S[u]) if(!vis[i]) vis[i]=1,Ans[++cnt]=i;
  Ans[++cnt]=b[u];

  ct=0;
  for(auto v:G[u][1]) if(G[v][0].empty()&&G[v][1].empty()) Q.push(-b[v]),++ct;
  assert(G[u][1].size()-ct<=1);
  for(auto v:G[u][1]) dfs2(v);
}

int main(){
  ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
  cin>>n>>W;
  for(int i=n;i>=1;i--) cin>>b[i],p[b[i]]=i;
  for(int i=1;i<=n;i++) cin>>a[p[i]],fa[i]=i,id[i]=i;
  ++n,id[n]=n,a[n]=W+1,fa[n]=n,b[n]=n;
  sort(id+1,id+n+1,[&](int x,int y){return a[x]>a[y];});

  for(int i=1,k;i<=n;i++){
	k=tp;
	while(k>0&&a[st[k]]<=a[i]) --k;
    if(k) rs[st[k]]=i,pre[i]=st[k];
	if(k<tp) ls[i]=st[k+1],pre[st[k+1]]=i;
	tp=k,st[++tp]=i;
  }

//   cerr<<"hi"<<endl;

  for(int i=1,r=n;i<=n;i++){
	// cerr<<"i = "<<i<<endl;
    while(r>=1&&a[id[r]]+a[id[i]]<=W) merge(id[r],ls[id[r]]),merge(id[r],rs[id[r]]),--r;
    if(i!=1){
	  int u=pre[find(id[i])],v=id[i];
	//   cerr<<u<<" -> "<<v<<endl;
	  if(v<u) G[u][0].pb(v);
	  else G[u][1].pb(v);
	}
  }
  dfs1(n,n+1),dfs2(n);

//   cerr<<"cnt = "<<cnt<<endl;

  cout<<ans<<'\n';

  for(int i=1;i<n;i++) cout<<Ans[i]<<' ';
  return 0;
}