#include <bits/stdc++.h>
#define il inline
#define ll long long
#define int ll
#define Max 200005
using namespace std;
il ll read()
{
	char c=getchar();
	ll x=0,f=1;
	while(c>'9'||c<'0')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
signed main()
{
	int n=read(),m=read();
	int ans1=n/2+1+(m)/2,ans2=m/2+1+n/2;
	vector<vector<int>> a;
	if(ans1<=ans2)
	{
		cout<<ans1<<"\n";
		for(int j=1;j<=m;j++)
		{
			if(j&1||(m%2==0&&j==m)) printf("1 ");
			else printf("0 ");
		}

		puts("");
		for(int i=2;i<=n;i++)
		{
			if(i&1||(n%2==0&&i==n)) printf("1 ");
			else printf("0 ");
			for(int j=2;j<=m;j++)
			{
				printf("0 ");
			}
			puts("");
		}
		
	}
	else
	{
		cout<<ans2<<"\n";
		swap(n,m);
		a.resize(n+2);
		a[1].resize(m+1);
		for(int j=1;j<=m;j++)
		{
			if(j&1||(m%2==0&&j==m)) a[1][j]=1;
			else a[1][j]=0;
		}
		for(int i=2;i<=n;i++)
		{
			a[i].resize(m+1);
			if((n%2==0&&i==n)||i&1) a[i][1]=1;
			else a[i][1]=0;
			for(int j=2;j<=m;j++)
			{
				a[i][j]=0;
			}
		}
		for(int i=1;i<=m;i++)
			for(int j=1;j<=n;j++)
			{
				printf("%lld%c",a[j][i]," \n"[j==n]);
			}
	}
}