#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, x[19];
void printSol()
{
    for(int i = 1; i <= m; i++)
        g << x[i] << " ";
    g << "\n";
}
void backtracking()
{
    int k = 1;
    x[k] = 0;
    while(k > 0)
    {
        if(x[k] < n)
        {
            x[k] ++;
            if(k == m)
                printSol();
            else
            {
                k ++;
                x[k] = x[k - 1];
            }
        }
        else
            k --;
    }
}
int main()
{
    f >> n >> m;
    backtracking();
    return 0;
}