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

vector <int> a[1000500], tmp;
int n, m;

vector <int> solve0(int len){
    vector <int> ret;
    if (len % 2 == 1){
        ret.push_back(1);
        for (int i = 1; i <= len / 2; i++){
            ret.push_back(0);
            ret.push_back(1);
        }
    } else {
        ret.push_back(1);
        ret.push_back(1);
        for (int i = 2; i <= len / 2; i++){
            ret.push_back(0);
            ret.push_back(1);
        }
    }
    return ret;
}

vector <int> solve1(int len){
    vector <int> ret;
    if (len % 2 == 1){
        ret.push_back(1);
        for (int i = 1; i <= len / 2; i++){
            ret.push_back(0);
            ret.push_back(1);
        }
    } else {
        for (int i = 1; i <= len / 2; i++){
            ret.push_back(0);
            ret.push_back(1);
        }
    }
    return ret;
}

int main(){
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        a[i].resize(m + 2);
    
    if (n == 1){
        tmp = solve0(m);
        int cnt = 0;
        for (int i = 1; i <= m; i++)
            a[1][i] = tmp[i - 1], cnt += tmp[i - 1];
        cout << cnt << endl;
    } else if (m == 1){
        tmp = solve0(n);
        int cnt = 0;
        for (int i = 1; i <= n; i++)
            a[i][1] = tmp[i - 1], cnt += tmp[i - 1];
        cout << cnt << endl;
    } else if (n == m){
        for (int i = 1; i <= n; i++)
            a[i][i] = 1;
        cout << n << endl;
    } else if (n < m){
        for (int i = 1; i <= n; i++)
            a[i][i] = 1;
        tmp = solve1(m - n);
        int cnt = 0;
        for (int i = n + 1; i <= m; i++)
            a[n][i] = tmp[i - n - 1], cnt += a[n][i];
        cout << cnt + n << endl;
    } else if (n > m){
        for (int i = 1; i <= m; i++)
            a[i][i] = 1;
        tmp = solve1(n - m);
        int cnt = 0;
        for (int i = m + 1; i <= n; i++)
            a[i][m] = tmp[i - m - 1], cnt += a[i][m];
        cout << cnt + m << endl;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            cout << a[i][j] << (j == m ? '\n' : ' ');
    return 0;
}