15650.java

import java.util.*;

public class Main {
  public static boolean[] visited = new boolean[10];
  public static Stack<Integer> result = new Stack<Integer>();
  public static int N;
	public static int M;
  
  public static void dfs(int depth){
    
    if(depth == M){
      for(int x: result) 
				System.out.print(x + " ");
			
      System.out.println();
      return;
    }

    for(int i = 1; i <= N; i++) {			
			if (!visited[i] && (result.isEmpty() || i>result.peek())) { 
				visited[i] = true;
        result.push(i);
				dfs(depth + 1);
     		visited[i] = false;
      	result.pop();
			}
    }
  }
  
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    N = scanner.nextInt();
		M = scanner.nextInt();
		
    dfs(0);
    scanner.close();
  }
}