#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int n,m,f[111000][30],ans,A[20];
void dfs(int x,int sum,int k)
{
	if(sum>n) return ;
	if(x==m)
	{
		if(sum==n)
		{
		
			if(A[m]<A[m-1]) return ;
			ans++;
			for(int i=1;i<=m;i++)
				f[ans][i]=A[i];
		}
		return ;
	}
	for(int i=k;i+sum<=n;i++)
	{
		A[x+1]=i;
		dfs(x+1,sum+i,i);
	}
}
int main()
{
	freopen("dataa.in","r",stdin);
	freopen("dataa.out","w",stdout);
	scanf("%d%d",&n,&m);
	dfs(0,0,1);
	printf("%d\n",ans);
	for(int i=1;i<=ans;i++)
	{
		for(int j=1;j<=m;j++)
		printf("%d ",f[i][j]);
		printf("\n");
	}
	fclose(stdin);
	fclose(stdout);
}