#include <fstream>

using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int i,j,a[21],k,n;
int main()
{
    f>>n>>k;
    for(i=1;i<=k;++i) a[i]=i;

    while(a[1]<=n-k+1)
    {
      for(i=1;i<k;++i) g<<a[i]<<" ";
      g<<a[k]<<'\n';
      a[k]++;
      for(i=k;i>=2;--i)
      if(a[i]>n-k+i)
      {
        a[i-1]++;
        for(j=i;j<=k;++j) a[j]=a[j-1]+1;
      }
      else break;


    }


    return 0;
}