#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

inline int read() {
    int f = 1, k = 0;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        k = k * 10 + c - '0';
        c = getchar();
    }
    return f * k;
}

int main() {
    // ios::sync_with_stdio(0); cin.tie(0);
    int n = read(), m = read();
    vector<vector<int>> a(n + 1, vector<int>(m + 1));
    if (n & 1 && m & 1) {
        for (int i = 1; i <= m; i += 2) a[1][i] = 1;
        for (int i = 1; i <= n; i += 2) a[i][1] = 1;
    } else if (n & 1) {
        for (int i = 1; i <= m; i += 2) a[1][i] = 1;
        a[1][m] = 1;
       for (int i = 1; i <= n; i += 2) a[i][1] = 1;
    } else if (m & 1) {
        for (int i = 1; i <= n; i += 2) a[i][1] = 1;   
        a[n][1] = 1;
        for (int i = 1; i <= m; i += 2) a[1][i] = 1;
    } else {
        for (int i = 2; i <= m; i += 2) a[1][i] = 1;
        for (int i = 2; i <= n; i += 2) a[i][1] = 1;   
    }
    int ans = 0;
    for (int i = 1; i <= n; ++i) ans += accumulate(a[i].begin(), a[i].end(), 0);
    printf("%d\n", ans);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) 
            printf("%d ", a[i][j]);
        puts("");
    }
}