#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
ll n, k, ans = -1e18;
cin >> n >> k;
vll b(n), s(n);
for (ll i = 0; i < n; ++i)
cin >> b[i];
for (ll i = 0; i < n; ++i)
cin >> s[i];
string ss(n, '0');
vll pre(n);
set<pll, greater<pll>> wind;
for (ll i = 0; i < n; ++i) {
pre[i] = (i == 0 ? 0 : pre[i - 1]) + b[i];
if (!wind.empty()) {
ll my_ans = s[i] - pre[i] + wind.begin()->first;
ans = max(ans, my_ans);
}
wind.insert({(i == 0 ? 0 : pre[i - 1]) + s[i], i});
}
set<ll> vals;
wind.clear();
for (ll i = 0; i < n; ++i) {
if (!wind.empty()) {
ll best = wind.begin()->first;
ll my_ans = s[i] - pre[i] + best;
if (my_ans == ans) {
ss[i] = '1';
auto it = wind.begin();
while (it != wind.end() && it->first == best) {
ss[it->second] = '1';
++it;
}
}
}
wind.insert({(i == 0 ? 0 : pre[i - 1]) + s[i], i});
}
// vll in(n), res(n);
// for (ll st = 0; st < n; ++st) {
// ll sum_buy = 0;
// priority_queue<pll, vector<pll>, greater<pll>> pq;
// ll sum_pq = 0;
// in.assign(n, 0);
// for (ll ed = st; ed < n; ++ed) {
// sum_buy += b[ed];
// pq.push({s[ed], ed});
// in[ed] = 1;
// sum_pq += s[ed];
// while (pq.size() > k) {
// auto [node, idx] = pq.top();
// pq.pop();
// sum_pq -= node;
// in[idx] = 0;
// }
// if (pq.size() == k) {
// ll ans_ed = sum_pq - sum_buy;
// if (ans < ans_ed) {
// ans = ans_ed;
// res = in;
// }
// }
// }
// }
cout << ans << endl;
// for (ll i = 0; i < n; ++i)
// if (res[i] == 1)
// ss[i] = '1';
cout << ss << endl;
return 0;
}
