#include<bits/stdc++.h> using namespace std; int n,m,qwq[30]; void awa(int pwp) { if(m==pwp){ for(int i=0;i<pwp;i++) cout<<qwq[i]; cout<<endl; } else{ qwq[pwp]=qwq[pwp-1]+1; for(;qwq[pwp]<=n;qwq[pwp]++) awa(pwp+1); } } int main() { cin>>n>>m; awa(0); return 0; }