#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 250100;

ll n, m, a[maxn], b[maxn], lsh[maxn], tot, ans = -1e18;
vector<pii> S, vc[maxn];
vector<int> ap[maxn];

struct BIT {
	ll c[maxn];
	
	inline void init() {
		mems(c, 0);
	}
	
	inline void update(int x, ll d) {
		x = tot - x + 1;
		for (int i = x; i <= tot; i += (i & (-i))) {
			c[i] += d;
		}
	}
	
	inline ll query(int x) {
		x = tot - x + 1;
		ll res = 0;
		for (int i = x; i; i -= (i & (-i))) {
			res += c[i];
		}
		return res;
	}
	
	inline int kth(int k) {
		int s = 0, p = 0;
		for (int i = 18; ~i; --i) {
			if (p + (1 << i) <= tot && s + c[p + (1 << i)] < k) {
				s += c[p += (1 << i)];
			}
		}
		return tot - p;
	}
} t1, t2;

int l = 1, r;

inline ll calc(int L, int R) {
	while (l > L) {
		t1.update(b[--l], 1);
		t2.update(b[l], lsh[b[l]]);
	}
	while (r < R) {
		t1.update(b[++r], 1);
		t2.update(b[r], lsh[b[r]]);
	}
	while (l < L) {
		t1.update(b[l], -1);
		t2.update(b[l], -lsh[b[l]]);
		++l;
	}
	while (r > R) {
		t1.update(b[r], -1);
		t2.update(b[r], -lsh[b[r]]);
		--r;
	}
	int p = t1.kth(m);
	return t2.query(p + 1) + lsh[p] * (m - t1.query(p + 1)) - a[R] + a[L - 1];
}

void dfs(int l, int r, int pl, int pr) {
	if (l > r || pl > pr) {
		return;
	}
	int mid = (l + r) >> 1, p = -1;
	ll res = -1e18;
	for (int i = pl; i <= min(pr, mid - (int)m + 1); ++i) {
		ll val = calc(i, mid);
		if (val >= res) {
			res = val;
			p = i;
		}
	}
	if (res > ans) {
		ans = res;
		vector<pii>().swap(S);
		S.pb(p, mid);
	} else if (res == ans) {
		S.pb(p, mid);
	}
	dfs(l, mid - 1, pl, p);
	dfs(mid + 1, r, p, pr);
}

int fa[maxn];
bool f[maxn];

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

void solve() {
	scanf("%lld%lld", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]);
		a[i] += a[i - 1];
	}
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &b[i]);
		lsh[++tot] = b[i];
	}
	sort(lsh + 1, lsh + tot + 1);
	tot = unique(lsh + 1, lsh + tot + 1) - lsh - 1;
	for (int i = 1; i <= n; ++i) {
		b[i] = lower_bound(lsh + 1, lsh + tot + 1, b[i]) - lsh;
		ap[b[i]].pb(i);
	}
	dfs(m, n, 1, n);
	sort(S.begin(), S.end());
	int i = 1;
	for (pii p : S) {
		while (1) {
			if (calc(i, p.scd) == ans) {
				vc[t1.kth(m)].pb(i, p.scd);
			}
			if (i == p.fst) {
				break;
			}
			++i;
		}
	}
	for (int i = 1; i <= n + 1; ++i) {
		fa[i] = i;
	}
	for (int i = 1; i <= tot; ++i) {
		for (pii p : vc[i]) {
			for (int j = find(p.fst); j <= p.scd; j = find(j + 1)) {
				f[j] = 1;
				fa[j] = j + 1;
			}
		}
		for (int j : ap[i]) {
			fa[j] = j + 1;
		}
	}
	printf("%lld\n", ans);
	for (int i = 1; i <= n; ++i) {
		putchar('0' + f[i]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}