#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<list>
#define pb push_back
using namespace std;
int n,m,st[20];
void back(int k)
{
    if(k<=m)
    {
        for(int i=st[k-1]+1;i<=n;++i)
        {
            st[k]=i;
            if(k==m)
            {
                for(int j=1;j<=m;++j)
                    printf("%d ",st[j]);
                printf("\n");
            }
            else
                back(k+1);
        }
    }
}

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