import java.io.*;
import java.util.StringTokenizer;

public class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    static int[] ans;

    public static void main(String[] args) throws IOException {
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken());
        ans = new int[m];
        cal(0, 1, n, m);
        bw.flush();
        bw.close();
    }

    public static void cal(int idx, int start, int n, int m) throws IOException {
        if (idx == m) {
            StringBuilder sb = new StringBuilder();
            for (int a : ans)
                sb.append(a + " ");
            bw.write(sb.toString());
            bw.newLine();
            return;
        }

        for (int i = start; i <= n; i++) {
            ans[idx] = i;
            cal(idx + 1, i + 1, n, m);
        }
    }
}

import java.util.*;
public class Main {
    static int[] a = new int[10];
    //index : 자연수, index라는 수를 결과에 포함할껀지 말껀지 결정
    //selected 지금까지 선택한 수의 개수
    static void go(int index, int selected, int n, int m) {
        if (selected == m) {
            for (int i=0; i<m; i++) {
                System.out.print(a[i]);
                if (i != m-1) System.out.print(' ');
            }
            System.out.println();
            return;
        }
        if (index > n) return;
        //index를 추가
        //(먼저 나와야함- 숫자 크기 순으로 나와야 하기떄문)
        a[selected] = index;
        go(index+1, selected+1, n, m);
        //index를 추가안함
        a[selected] = 0;
        go(index+1, selected, n, m);
    }   
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        go(1, 0, n, m);
    }
}