// Problem: D - Sequence exploration
// Contest: Virtual Judge - Namomo Summer Camp 23 Day 3
// URL: https://vjudge.net/contest/577185#problem/D
// Memory Limit: 254 MB
// Time Limit: 1000 ms

#include <bits/stdc++.h>
using namespace std;

// 2023 OneWan

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	long long n;
	int m;
	cin >> n >> m;
	// int cnt = 1;
	vector<int> res;
	res.emplace_back(1);
	auto get = [&](const vector<int> &res) {
		vector<int> temp;
		int cnt0 = 0, last = res.front();
		for (auto &x : res) {
			if (x == last) {
				cnt0++;
			} else {
				temp.emplace_back(cnt0);
				temp.emplace_back(last);
				cnt0 = 1;
			}
			last = x;
		}
		if (cnt0) {
			temp.emplace_back(cnt0);
			temp.emplace_back(last);
		}
		return temp;
	};
	vector<vector<int>> ans(50);
	ans[1] = res;
	for (int i = 2 ; i < 50 ; i++) {
		ans[i] = get(ans[i - 1]);
	}
	for (int i = 1 ; i < 50 ; i++) {
		if (ans[i].size() > m) {
			reverse(begin(ans[i]), end(ans[i]));
			ans[i].resize(m);
			reverse(begin(ans[i]), end(ans[i]));
		}
	}
	if (n <= 50) {
		for (int i = max(0, int(ans[n].size()) - m) ; i < int(ans[n].size()) ; i++) {
			cout << ans[n][i];
		}
	} else {
		set<vector<int>> st;
		int start = -1;
		for (int i = 1 ; i < 50 ; i++) {
			if (st.count(ans[i])) {
				start = i;
				break;
			}
			st.emplace(ans[i]);
		}
		int z = (n - start) % 4;
		for (int i = max(0, int(ans[start + z].size()) - m) ; i < int(ans[start + z].size()) ; i++) {
			cout << ans[start + z][i];
		}
	}
	return 0;
}