#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

using namespace std;

ifstream in("piese.in");
ofstream out("piese.out");
int mat[501][501];
int main()
{
    int m, n, minim=0;
    in >> m >> n;
    for(int i=0; i<m; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(mat[i][j] == 0)
            {
                int x=i, y=j;
                int putere = 1;
                while(x+putere-1 < m && y+putere-1 < n)
                    putere *= 2;
                putere/=2;
                x+=(putere-1);
                y+=(putere-1);
                minim ++;
                for(int k=i; k<=x; k++)
                    for(int l=j; l<=y; l++)
                        mat[k][l]=minim;
            }
        }
    }
    out << minim << endl;
    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            out << mat[i][j] << " ";
        }
        out << "\n";
    }
    return 0;
}