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