#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

const int NMAX = 510;

int N, M, P[NMAX][NMAX], Cnt;

int main()
{
    freopen("piese.in", "r", stdin);
    freopen("piese.out", "w", stdout);

    scanf("%i %i", &N, &M);

    for(int i = 1; i <= N; ++ i)
        for(int j = 1; j <= M; ++ j)
            if(P[i][j] == 0)
            {
                Cnt ++;
                int Sz = 1;
                while(i + 2 * Sz - 1 <= N && j + 2 * Sz - 1 <= M)
                    Sz *= 2;

                for(int k = i; k <= i + Sz - 1; ++ k)
                    for(int l = j; l <= j + Sz - 1; ++ l)
                        P[k][l] = Cnt;
            }

    printf("%i\n", Cnt);
    for(int i = 1; i <= N; ++ i)
    {
        for(int j = 1; j <= M; ++ j)
            printf("%i ", P[i][j]);
        printf("\n");
    }

    return 0;
}