#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 2.5e5+10,INF = 1e18;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}

int n,k,a[N],b[N];
int arr[N],rk[N];

namespace T1{ //corner
    void solve(){
        ll mx = -INF; for(int i=1;i<=n;i++)tomax(mx,(ll)b[i]-a[i]);
        cout<<mx<<"\n";    
        for(int i=1;i<=n;i++)cout<<(b[i]-a[i] == mx);
        exit(0);
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)cin>>b[i],arr[i] = i;
    sort(arr+1,arr+1+n,[&](int x,int y){return b[x] >= b[y];});
    for(int i=1;i<=n;i++)rk[arr[i]] = i;

    if(k==1)T1::solve();

    return 0;
}