#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int maxn = 1000010;

const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll INF = 2e18;

int n, m;

vector<int> v[maxn];
vector<int> aux[maxn];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m;
    bool transposed = false;

    if( n > m )
        swap( n , m ), transposed = true;

    for(int i = 0 ; i < n ; i++)    
        v[i].resize( m );

    int p = 0;
    int ans = 0;

    while( p + n <= m )
    {
        for(int i = 0 ; i < n ; i++)
            v[i][p++] = 1, ans++;

        p++;
    }

    p--;
    int line = max( n - 2 , 0 );

    while( p < m )
        v[line][p] = 1, ans++, line = max(0, line - 1), p++;

    if( transposed )
    {
        for(int i = 0 ; i < m ; i++)
            aux[i].resize( n );

        for(int i = 0 ; i < n ; i++)
            for(int j = 0 ; j < m ; j++)    
                aux[j][i] = v[i][j];

        swap( n , m );

        for(int i = 0 ; i < n ; i++)
            v[i].resize( m );

        for(int i = 0 ; i < n ; i++)
            for(int j = 0 ; j < m ; j++)    
                v[i][j] = aux[i][j];
    }

    cout << ans << endl;

    for(int i = 0 ; i < n ; i++, cout << endl)
        for(int j = 0 ; j < m ; j++)
            cout << v[i][j] << " ";
    
    return 0;
}