#include <fstream>

using namespace std;

ifstream f ("combinari.in");
ofstream g ("combinari.out");
int v[1000] , n , p;
int verif ( int k )
{
        if ( k > 1)
        if ( v[k] <= v[k-1])
        return 0;
    return 1;
}
void afis()
{
    for ( int i = 1 ; i <= p; ++i)
        {g << v[i] << ' ';}
    g << '\n';
}
void vback()
{
    int k = 1;
    v[k] = 0;
    do
    {
        while (v[k] < n )
        {
            v[k]++;
            if ( verif(k))
                if(k == p)
                afis();
            else
            {
                k++;
                v[k] = 0;
            }
        }
        k--;
    }while(k > 0);
}
int main ()
{
    f >> n >> p;
        vback();
        return 0;
}