#include<bits/stdc++.h> #define endl '\n' using namespace std; int n,m,a[114],cnt=0; void dfs(int x) { if(x>m){ for(int i=1;i<=m;i++) cout<<a[i]; cout<<endl; return; } for(int i=a[x-1]+1;i<=n;i++){ a[x]=i; dfs(x+1); } } signed main() { cin>>n>>m; dfs(1); return 0; }