#include <bits/stdc++.h>
using namespace std;
int n,k;
unsigned long long a[70];
string dfs(unsigned long long n,unsigned long long k){
	if (n == 1){
		if (k == 0) return "0";
		else return "1";
	}
	if (k<a[n-1]) return "0"+dfs(n-1,k);
	else return "1"+dfs(n-1,a[n]-k-1);
}

int main(){
	cin>>n>>k;
	a[0] = 1;
	for (int i = 1;i<=65;i++){
		a[i] = a[i-1]*2;
	}
	cout<<dfs(n,k);
	return 0;
}