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

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define LC k << 1
#define RC k << 1 | 1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i = a; i < n; i++)
#define repn(i,a,n) for (int i = a; i <= n; i++)
#define per(i,a,n) for (int i = n - 1; i >= a; i--)
#define pern(i,a,n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int N = 1100000;
const int M = 1100;
const int mod = 998244353;
const int inf = (int)1e9;
const LL INF = (LL)1e12 + 5;
const double eps = 1e-10;
const double pi = acos(-1.0);

int n, m;
vector<int> a[N];


int main() {
	IO;
	cin >> n >> m;
	int cnt = 0;
	repn(i, 1, n) {
		repn(j, 0, m) a[i].pb(0);
	}
	for (int i = 1; i<= n; i += 2) {
		a[i][1] = 1; cnt++;
	}
	for(int i = 1; i <= m; i += 2) {
		a[1][i] = 1; cnt ++;
	}
	cnt --;
	if (n % 2 == 0 || m % 2 == 0) {
		a[n][m] = 1; cnt ++;
	}
	cout << cnt << "\n";
	repn(i, 1, n) {
		repn(j, 1, m) {
			cout << a[i][j] << " ";
		}
		cout << "\n";
	} 
	return 0;
}