#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, K;
	string S;
	cin >> N >> K >> S;

	lint a=0, b=0, c=0, x, y, z;
	vi v(N);
	rep(i, N) v[i] = S[i]-'0';
	x = (N-K)/2;
	rep(i, K) {
		if ((N-K)%2 == 0) {
			if ((v[x+i-1] && v[x+i]) || (v[x+i+1] && v[x+i])) std::cout << '1';
			else std::cout << '0';
		} else {
			std::cout << !(v[x+i] & v[x+i+1]);
		}
	}
	std::cout << '\n';
}