#include<iostream> using namespace std; int n,m,id; int a[21]; void dfs(int id){ if(id>=m){ for(int i=0;i<m;i++){ cout<<a[i]<<" "; } cout<<endl; } else { a[id]=a[id-1]+1; for(;a[id]<=n;a[id]++){ dfs(id+1); } } return ; } int main(){ cin>>n>>m; dfs(0); return 0; }