#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=3e5+10;

int main(){


    ///freopen("test.txt","r",stdin);

    int n,m;
    scanf("%d %d",&n,&m);

    vector<vector<int>>a(n,vector<int>(m));

    int currx=0;
    int curry=0;
    int rez=0;
    for(int i=1;i<=min(n,m);i++){
        a[currx][curry]=1;
        rez++;
        currx++;
        curry++;
    }
    currx--;
    curry--;
    int dx=0;
    int dy=0;
    if(n>m){
        dx=2;
    }
    else dy=2;

    currx+=dx;
    curry+=dy;
    while(currx<n && curry<m){
        rez++;
        a[currx][curry]=1;
        currx+=dx;
        curry+=dy;
    }

    if(n>m){
        if( (n-min(n,m))%2==1 ){
            a[n-1][m-1]=1;
            rez++;
        }
    }
    else{
        if( (m-min(n,m))%2==1 ){
            a[n-1][m-1]=1;
            rez++;
        }
    }

    printf("%d\n",rez);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++)printf("%d ",a[i][j]);
        printf("\n");
    }

    return 0;
}