#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mo = 998244353;
const int P = 1e9 + 7;
const int maxn = 2010;
int f[maxn][maxn];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    if(n == 2 && m == 2) {
        cout << 2 << "\n";
        cout << "1 0\n0 1\n";
        return 0;
    }
    int cnt = 0;
    int nn,mm;
    if(n % 2 == 0) nn = n - 1;
    else nn = n;
    if(m % 2 == 0) mm = m - 1;
    else mm = m;
    for(int i = 0;i < nn;i ++) {
        for(int j = 0;j < mm;j ++) {
            if(i % 3 == 0) {
                if(j % 2 == 0){
                    cnt ++;
                    f[i][j] = 1;
                }
            }else if(i % 3 == 2) {
                if(j % 2 == 1) {
                    cnt ++;
                    f[i][j] = 1;
                }
            }
        }
    }
    if(n % 2 == 0) {
        f[n - 1][0] = 1;
        cnt ++;
    }
    if(m % 2 == 0){
        f[0][m - 1] = 1;
        cnt ++;
    }
    cout << cnt << endl;
    for(int i = 0;i < n;i ++) {
        for(int j = 0;j < m;j ++) {
            cout << f[i][j] << " ";
        }cout << "\n";
    }
    // }
}