#include <iostream>
using namespace std;
int path[100],idx=0;
void findsteps(int n, int k, int sum, int idx)
{
if(sum==n)
{
for(int i=0;i<idx;i++)
cout<<path[i];
cout<<endl;
return;
}
if(sum>n)
return;
if(sum<n)
{
for(int i=1;i<=k;i++)
{
path[idx]=i;
findsteps(n,k,sum+i,idx+1);
}
}
}
int main() {
// your code goes here
int n,k;
cin>>n>>k;
findsteps(n,k,0,0);
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IHBhdGhbMTAwXSxpZHg9MDsKCnZvaWQgZmluZHN0ZXBzKGludCBuLCBpbnQgaywgaW50IHN1bSwgaW50IGlkeCkKewoJaWYoc3VtPT1uKQoJewoJCWZvcihpbnQgaT0wO2k8aWR4O2krKykKCQkgY291dDw8cGF0aFtpXTsKCQkgCgkJIGNvdXQ8PGVuZGw7CgkJIHJldHVybjsKCX0KCWlmKHN1bT5uKQoJcmV0dXJuOwogICAgaWYoc3VtPG4pCiAgICB7CgkJZm9yKGludCBpPTE7aTw9aztpKyspCgkJIHsKCQkgCXBhdGhbaWR4XT1pOwoJCSAJZmluZHN0ZXBzKG4sayxzdW0raSxpZHgrMSk7CgkJIH0KICAgIH0KfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgbixrOwoJY2luPj5uPj5rOwoJZmluZHN0ZXBzKG4saywwLDApOwoJcmV0dXJuIDA7Cn0=