#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=250005;
int cnt;
struct node
{
    int x,y,ls,rs;
}tr[N*64];
int n,K;
int m;
int a[N],b[N],v[N][3];
int pos[N];
int rt[N];
poly g;
poly I[N],E[N];
int vis[N];
int from[N];
int update(int u,int l,int r,int L,int x,int y)
{
    int k=++cnt;
    tr[k]=tr[u];
    tr[k].x+=x;
    tr[k].y+=y;
    if (l==r) return k;
    int mid=l+(r-l)/2;
    if (L<=mid) tr[k].ls=update(tr[u].ls,l,mid,L,x,y);
    else tr[k].rs=update(tr[u].rs,mid+1,r,L,x,y);
    return k;
}
int Mn,Sum;
void qry(int kr,int kl,int l,int r,int k)
{
    if (l==r)
    {
        Mn=l;
        Sum+=k*g[l-1];
        return;
    }
    int mid=l+(r-l)/2;
    int rt=tr[tr[kr].rs].x-tr[tr[kl].rs].x;
    if (k>rt)
    {
        Sum+=tr[tr[kr].rs].y-tr[tr[kl].rs].y;
        qry(tr[kr].ls,tr[kl].ls,l,mid,k-rt);
    } else
    {
        qry(tr[kr].rs,tr[kl].rs,mid+1,r,k);
    }
}
int trans(int i,int j)
{
    if (j-i-1>=K-2) 
    {
        Mn=sz(g)+1,Sum=0;
        if (K-2)
            qry(rt[j-1],rt[i],1,m,K-2);
        Mn--;
        if (Mn<sz(g)) Mn=g[Mn]; else Mn=inf;
        return Sum+v[j][2]+v[i][0];
    }
    return -inf;
}
void solve(int l,int r,int L,int R)
{
    if (l==r)
    {
        for (int i=L;i<=R;i++) from[i]=l;
        return;
    }
    if (L>R) return;
    int mid=L+(R-L)/2;
    int pos=l,lstv=trans(l,mid);
    for (int i=l;i<mid&mid-i-1>=K-2&&i<=r;i++)
    {
        int nv=trans(i,mid);
        // cout<<"??"<<i<<" "<<mid<<" "<<nv<<endl;
        if (nv>lstv) 
        {
            pos=i;
            lstv=nv;
        }
    }
    from[mid]=pos;
    // cout<<pos<<"->"<<mid<<" "<<lstv<<" "<<trans(3,mid)<<endl;
    solve(l,pos,L,mid-1);
    solve(pos,r,mid+1,R);
}
void BellaKira()
{
    cin>>n>>K;
    for (int i=1;i<=n;i++)
        cin>>a[i],a[i]+=a[i-1];
    for (int i=1;i<=n;i++)
        cin>>b[i];
    for (int i=1;i<=n;i++)
    {
        v[i][0]=b[i]+a[i-1];
        v[i][1]=b[i];
        v[i][2]=b[i]-a[i];
    }
    if (K==1)
    {
        int mn=inf;
        for (int i=1;i<=n;i++) mn=min(mn,b[i]-a[i]+a[i-1]);
        cout<<mn<<'\n';
        for (int i=1;i<=n;i++)
            if (b[i]-a[i]+a[i-1]==mn) cout<<1;
            else cout<<0;
        cout<<'\n';
        return;
    }
    for (int i=1;i<=n;i++) 
    {
        g.push_back(v[i][1]);
    }
    sort(g.begin(),g.end());
    g.erase(unique(g.begin(),g.end()),g.end());
    for (int i=1;i<=n;i++) 
    {
        pos[i]=lower_bound(g.begin(),g.end(),v[i][1])-g.begin()+1;
    }
    m=sz(g);
    for (int i=1;i<=n;i++)
    {
        rt[i]=rt[i-1];
        rt[i]=update(rt[i],1,m,pos[i],1,v[i][1]);
    }
    int ans=-inf;
    int lst=1;
    
    solve(1,n,2,n);
    map<int,int>lst_oc;
    lst_oc[v[1][0]]=1;
    for (int j=2;j<=n;j++)
    {
        auto &i=from[j];
        i=lst_oc[v[i][0]];
        ans=max(ans,trans(i,j));
        if (!lst_oc.count(v[j][0]))
            lst_oc[v[j][0]]=j;
    }
    for (int j=2;j<=n;j++)
    {
        for (int i=1;i<j;i++)
        {
            if (trans(i,j)==ans)
            {
                assert(i>=from[j]);
                I[i].push_back(Mn),E[j].push_back(Mn),vis[i]=vis[j]=1;
            }
        }
    }
    multiset<int>S;
    for (int i=1;i<=n;i++)
    {
        for (auto u:I[i]) S.insert(u);
        for (auto u:E[i]) S.erase(S.find(u));
        if (S.size()&&v[i][1]>=(*S.begin()))  vis[i]=1;
    }
    cout<<ans<<'\n';
    for (int i=1;i<=n;i++) cout<<vis[i];
    cout<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/