#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<deque>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#include<ctime>
#include<cmath>
using namespace std;

int n,m;
int f[21][11]={1};
int a[11]={1};

void init()
{
	scanf("%d%d",&n,&m);
	for(int i=1; i<=n; i++)
	{
		for(int j=1; j<=m&&j<=i; j++)
		{
			f[i][j]=f[i-j][j]+f[i-1][j-1];
		}
	}
	printf("%d\n",f[n][m]);
}
void dfs(int x,int y)
{
	if(y==1)
	{
		for(int i=1; i<m; i++)
		printf("%d ",a[i]);
		printf("%d\n",x);
		return ;
	}
	for(int i=a[m-y]; i<=x/y; i++)
	{
		a[m-y+1]=i;
		dfs(x-i,y-1);
	}
}
int main()
{
	#define SUBMIT
    #ifdef SUBMIT
    freopen("dataa.in","r",stdin);
    freopen("dataa.out","w",stdout);
    #endif
	init();
	dfs(n,m);

    #ifdef SUBMIT
    fclose(stdin);
    fclose(stdout);
    #endif
}