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

void solve(){
    int n , m;
    cin >> n >> m;
    vector<vector<int>> a(n+1,vector<int>(m+1));
    for(int i=1;i<=n;i+=2){
        a[1][i] = 1;
    }
    if(m%2==0){
//        a[2][m] = 1;
        for(int i=2;i<=n;i+=2){
            a[i][m] = 1;
        }
        if(n%2==1){
            a[n][m] = 1;
        }
    } else{
        if(n%2==0){
            a[n][m] = 1;
        }
        for(int i=1;i<=n;i+=2){
            a[i][m] = 1;
        }
    }
    int cnt = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i][j] == 1) cnt ++;
        }
    }
    cout << cnt << '\n';
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cout << a[i][j] << ' ';
        }
        cout << '\n';
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
//    cin >> tt;
    while (tt--) solve();
}