#include <iostream>
#include <cstdio>

using namespace std;

int n , p , x[18] ;

void afis ( int k )
{
    for ( int i = 1 ; i <= k ; ++i )
        printf ("%d " , x[i]);
    printf ("\n");
}
void back (int k)
{
    if ( k == p+1 )
    {
        afis(k-1);
        return;
    }
    else
    for ( int i = x[k-1]+1 ; i <= n-p+k ; ++i )
    {
        x[i]=i;
        back(k++);
    }

}
int main()
{
    freopen ("combinari.in" , "r" , stdin );
    freopen ("combinari.out" , "w" , stdout );
    scanf ("%d%d" , &n , &p );
    back( 1 ) ;
    return 0;
}