#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+7;
typedef long long LL;
template <typename T>inline void read(T &x)
{
    x=0;char c=getchar();bool f=0;
    for(;c<'0'||c>'9';c=getchar())f|=(c=='-');
    for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c-'0');
    x=(f?-x:x);
}
int n,L;
int p[N],a[N],w[N];
int ls[N],rs[N],fa[N][22],stk[N],top=0;
int siz[N],jump[N];
const int mod = 1e9+7;
int fac[N],ifac[N];
vector<int> vec[N];
int Pow(int a,int b)
{
    int res=1;
    while(b)
    {
        if(b&1)res=1ll*res*a%mod;
        a=1ll*a*a%mod;
        b>>=1;
    }
    return res;
}
int A(int n,int m)
{
    if(n<0||m<0||n<m)return 0;
    return 1ll*fac[n]*ifac[n-m]%mod;
}
int frt[N],lst[N];
int pre[N],nxt[N];
int seq[N],m=0;
void lnk(int x,int y)
{
    if(!x&&!y)return;
    if(!x)pre[y]=0;
    else if(!y)nxt[x]=0;
    else
    {
        pre[y]=x;
        nxt[x]=y;
    }
}
void cut(int x,int y)
{
    nxt[x]=pre[y]=0;
}
int dfs(int x)
{
    if(!x)return 1;
    if(jump[x]!=x)return 1;
    int res=1ll*dfs(ls[x])*dfs(rs[x])%mod;
    siz[x]=1+siz[ls[x]]+siz[rs[x]];
    frt[x]=lst[x]=x;
    if(lst[ls[x]])lnk(lst[ls[x]],x),frt[x]=frt[ls[x]];
    if(frt[rs[x]])lnk(x,frt[rs[x]]),lst[x]=lst[rs[x]];
    res=1ll*res*A(siz[x]+vec[x].size(),vec[x].size())%mod;
    sort(vec[x].begin(),vec[x].end(),[&](int i,int j){return p[i]<p[j];});
    if(!vec[x].empty())
    {
        for(int j=0;j<vec[x].size()-1;j++)
        lnk(vec[x][j],vec[x][j+1]);
        m=0;
        int i=frt[x],j=vec[x][0],o=0;
        while(i&&j)
        {
            if(p[i]<p[j])
            {
                int t=nxt[i];
                cut(i,nxt[i]);
                if(!o)frt[x]=i;
                lnk(o,i);
                o=i;
                i=t;
            }
            else
            {
                int t=nxt[j];
                cut(j,nxt[j]);
                if(!o)frt[x]=j;
                lnk(o,j);
                o=j;
                j=t;
            }
        }
        if(i)lnk(o,i);
        else lnk(o,j),lst[x]=vec[x].back();
    }
    siz[x]+=vec[x].size();
    return res;
}
int main()
{
    //freopen("a.in","r",stdin);
    read(n);read(L);
    for(int i=1;i<=n;i++)read(p[i]);
    reverse(p+1,p+n+1);
    for(int i=1;i<=n;i++)read(w[i]);
    for(int i=1;i<=n;i++)a[i]=w[p[i]];
    for(int i=1;i<=n;i++)
    {
        while(top&&a[stk[top]]<=a[i])ls[i]=stk[top--];
        if(top)rs[stk[top]]=i,fa[i][0]=stk[top];
        stk[++top]=i;
        if(ls[i])fa[ls[i]][0]=i;
    }
    for(int k=1;k<=20;k++)
    for(int i=1;i<=n;i++)
    fa[i][k]=fa[fa[i][k-1]][k-1];
    for(int i=1;i<=n;i++)
    {
        int x=i;
        for(int k=20;k>=0;k--)
        if(fa[x][k]&&a[fa[x][k]]+a[i]<=L)
        x=fa[x][k];
        if(a[x]+a[i]>L)x=i;
        if(x!=i)vec[x].push_back(i);
        jump[i]=x;
    }
    int r=0;
    for(int i=1;i<=n;i++)if(!fa[i][0])r=i;
    fac[0]=1;
    for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
    ifac[n]=Pow(fac[n],mod-2);
    for(int i=n-1;i>=0;i--)ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
    int res=dfs(r);
    printf("%d\n",res);
    for(int i=1,x=frt[r];i<=n;i++,x=nxt[x])printf("%d ",p[x]);
	return 0;
}