#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define x first
#define y second
#define pb push_back
using namespace std;
//|-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-<>-|-|-|-|-|-|-<>-|-|-|-|-|-|-|-|-<>-|-|-|-|
typedef pair<int, int>PII;
int n, m;
map<int, int>mp;

void solve () {
    double a,b;
    cin>>a>>b;
    while(a>1e-4){
        a/=2.0;
        cout<<1;
    }
    vector<int>ans;
    double k=b;
    double res=1;
    for(int i=1;k>(1e-4);i++){
        res/=2.0;
        if(k>res){
            k-=res;
            ans.pb(i);
        }
    }
    int cnt=ans.size()-1;
    if(cnt==-1)return ;
    for(int i=ans[cnt];i>=1;i--){
        if(i==ans[cnt]){
            cout<<2;cnt--;
        }
        else cout<<1;
    }
}
signed main () {
    int T = 1; 
    std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    //cin>>T;
    while (T --) solve ();
    return 0;
}