#include <fstream>
#include <iostream>
using namespace std;

ifstream in("combinari.in");
ofstream out("combinari.out");

int n, m, k = 1, i, p, t[20];

int main()
{
  in >> n >> m;
  t[k] = 0;
  while (k){
    p = 0;
    if (t[k] < n){
      t[k] ++;
      p = 1;
    }
    if (p)
      if (k == m){
        for (i = 1; i <= m; i ++)
           out << t[i] << " ";
        out << endl;
      }
    else{
      k ++;
      t[k] = t[k - 1];
    }
    else k --;
  }
  return 0;
}