#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long  ull;
typedef pair<int,int> pii;
typedef pair<db,db> pdd;
typedef pair<ll,ll> pll;
void init();
void debug();
#define Clear(a)  memset(a,0,sizeof(a))
#define pb(x) push_back(x)
 
#define INF 1e9+10
const int N = 2e5+10;
const int M = 13210;
const int maxn = 3e5 +10;
const ll mod = 1e9+7;

const bool IN_TEST = 1;

vector<vector<int>> v;


int main()
{
    int n,m;
    cin>>n>>m;
    v.resize(n);
    for (auto& x:v)
    {
        x.resize(m);
        for (int& s:x) s=0;
    }

    if (n<m){
        for (int i=0; i<n; i++)
            v[i][i] = 1;
        
        for (int i=n+1; i<m; i+=2)
        {
            v[0][i] = 1;
        }

        if ((n-m) & 1) v[0][m-1] = 1;
    }
    else{
        for (int i=0; i<n; i++)
            v[i][i] = 1;
        
        for (int i=m+1; i<n; i+=2)
        {
            v[i][0] = 1;
        }
        if ((m-n) & 1) v[n-1][0] = 1;
    }

    int res=0;
    for (auto i:v)
    {
        for (auto j:i)
        {
            res += j;
        }
    }
    cout<<res<<endl;
    for (auto i:v)
    {
        for (auto j:i)
        {
            cout<<j<<' ';
        }
        cout<<endl;
    }

    return 0;
}