#include<bits/stdc++.h>
using namespace std;

//#define ONLINE
#ifndef ONLINE
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

template<typename T>
inline T READ(){
	T x=0; bool f=0; char c=getchar();
	while(c<'0' || c>'9') f|=(c=='-'),c=getchar();
	while(c>='0' && c<='9') x=x*10+c-'0',c=getchar();
	return f?-x:x;
}
inline int read(){return READ<int>();}
inline LL readLL(){return READ<LL>();}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int main(){
	int n=read(),m=read(),ans=min(n,m);
	vector a(n,vector<int>(m));
	for(int i=0;i<min(n,m);i++) a[i][i]=1;
	for(int i=n+1;i<m;i+=2,ans++) a[n-1][i]=1;
	for(int i=m+1;i<n;i+=2,ans++) a[i][m-1]=1;
	if(!a[n-1][m-1]){
		a[n-1][m-1]=1;
		ans++;
	}
	printf("%d\n",ans);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			printf("%d ",a[i][j]);
		}
		printf("\n");
	}
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/