#include<bits/stdc++.h>
using namespace std;
unsigned long long N;
unsigned long long K;
void dfs(unsigned long long n,unsigned long long k){
	if(n==1){
		if(k==1)cout<<0;
		else cout<<1;
		return;
	}
	unsigned long long tmp=pow(2,n-1);
	if(k>tmp){
		cout<<1;
		dfs(n-1,tmp-k+1+tmp);
	}
	else {
		cout<<0;
		dfs(n-1,k);
	}
	return;
}
int main(){
	cin>>N>>K;
	K++;
	dfs(N,K);
	return 0;
}