abc

#include<bits/stdc++.h>
using namespace std;
vector <long long> subset;
long long s,t,a[10000],q,k,n,i;
void sum()
{
    long long s=0;
    for(q=0;q<=subset.size();q++)
    {
    s+=subset[q];
    }
    if(s==t)
    {
        for(q=0;q<subset.size();q++)
        cout<<subset[q];
    }
}
void search(long long k)
{
    if(k==n+1)
    {
        sum();
    }
    else
    {
        search(k+1);
        subset.push_back(k);
        search(k+1);
        subset.pop_back();
    }

}
int main()
{
    cin>>t>>n;

    search(0);
}