#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll h,w;cin >> h >> w;
    if(h%2==0){
        if(w%2==0){
            cout << h*w << endl;
            rep(i,h){
                rep(j,w)cout << 1 <<" ";
                cout << endl;
            }
        }
        else{
            cout << h*(w-1) << endl;
            rep(i,h){
                rep(j,w-1)cout << 1 <<" ";
                cout << 0 << endl;
            }
        }
    }
    else{
        if(w%2==0){
            cout << (h-1)*w << endl;
            rep(i,h-1){
                rep(j,w)cout << 1 <<" ";
                cout << endl;
            }
            rep(j,w)cout << 0 << " ";cout << endl;
        }
        else{
            if(h>w){
                cout << (h)*(w-1) << endl;
                rep(i,h){
                    rep(j,w){
                        if(i==j)cout << 0 <<" ";
                        else if(j==w-1&&i>=w)cout << 0 <<" ";
                        else cout << 1 <<" ";
                    }
                    cout << endl;
                }
            }
            else{
                cout << (h-1)*(w) << endl;
                rep(i,h){
                    rep(j,w){
                        if(i==j)cout << 0 <<" ";
                        else if(i==h-1&&j>=h)cout << 0 <<" ";
                        else cout << 1 <<" ";
                    }
                    cout << endl;
                }
            }
        }
    }

}