#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");

int n,i,m,stiva[10];

void recursiv(int k)

{   for(stiva[k]=stiva[k-1]+1;stiva[k]<=n ;++stiva[k])
		if (k==m)
		{	for (i=1;i<=m;++i)
				fout << stiva[i] << " ";
		    fout << '\n';
		}
		else
			recursiv(k+1);
}

int main()
{   fin >> n >> m;
    recursiv(1);
	return 0;
}