#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ int H, W; cin >> H >> W; if (H == 1 || W == 1){ cout << 0 << endl; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ cout << 0; if (j != W - 1) cout << " "; } cout << endl; } } else if (H % 2 == 0 && W % 2 == 0){ cout << H * W << endl; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ cout << 1; if (j != W - 1) cout << " "; } cout << endl; } } else if (H % 2 == 0 && W % 2 == 1){ cout << H * (W - 1) << endl; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ if (j == W - 1){ cout << 0; } else{ cout << 1 << " "; } } cout << endl; } } else if (H % 2 == 1 && W % 2 == 0){ cout << (H - 1) * W << endl; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ if (i == H - 1){ cout << 0; } else{ cout << 1; } if (j != W - 1) cout << " "; } cout << endl; } } else{ vvi ans(H, vi(W, 1)); int min_val = min(H, W); for (int i = 0; i <= min_val - 1; i++){ ans[H - 1 - i][W - (min_val - i)] = 0; } for (int i = 0; i < H - 1; i++){ if (ans[i][W - 1] == 0) break; ans[i][W - 1] = 0; } for (int j = 0; j < W - 1; j++){ if (ans[H - 1][j] == 0) break; ans[H - 1][j] = 0; } int cnt = 0; rep(i,H){ rep(j,W){ cnt += ans[i][j]; } } cout << cnt << endl; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ cout << ans[i][j]; if (j < W - 1) cout << " "; } cout << endl; } } }