#include<bits/stdc++.h> using namespace std; int n,m; bool used[20]; int path[20]; void dfs(int pos){ if(pos==m){ for(int i = 0;i<m;i++){ printf("%3d",path[i]); } printf("\n"); return ; } for(int i =1;i<=n;i++){ if(!used[i]){ used[i] = true; path[pos] = i; dfs(pos+1); used[i] = false; } } } int main(){ cin>>n>>m; cout<<n<<" "<<m<<endl; dfs(0); return 0; }