#include<cstdio>

int n, m, a[11], sum, b[51][11], count=1;

void dfs(int dep, int k)
{
    for(int i = k;i <= n;i++)
    {
        bool bs = false;
        bool flag = false;
        if(dep == m)
        {
            a[dep] = n - sum;
            if(n - sum <= 0 || n - sum < a[dep - 1])
                flag = true;
        }
        else
        {
            a[dep] = i;
            sum += i;
            if(a[dep] < a[dep -1 ])
				flag = true;
        }
        if(dep == m)
        {
            for(int c = 1; c <= m; c++)
                if(a[c]!=b[count - 1][c])
				{
					bs = true;
					break;
				}
            if(!flag && bs)
            {
                for(int j = 1; j <= m; j++) 
					b[count][j] = a[j];
                count++;
            }
        }
        else
        {
            dfs(dep + 1, i);
            sum -= i;
        }
    }
}
int main()
{
    freopen("dataa.in", "r", stdin);
	freopen("dataa.out", "w", stdout);
    scanf("%d %d", &n, &m);
    dfs(1 ,1);
    printf("%d\n", count - 1);
    for(int i = 1; i <= count - 1; i++)
    {
        for(int j = 1; j <= m - 1; j++)
            printf("%d ", b[i][j]);
        printf("%d\n", b[i][m]);
    }
    return 0;
}