#ifndef LOCAL #define FAST_IO #endif // ===== template.hpp ===== #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define OVERRIDE(a, b, c, d, ...) d #define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i) #define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i) #define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__) #define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i) #define ALL(x) begin(x), end(x) using namespace std; using u32 = unsigned int; using u64 = unsigned long long; using u128 = __uint128_t; using i32 = signed int; using i64 = signed long long; using i128 = __int128_t; using f64 = double; using f80 = long double; template using Vec = vector; template bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } istream &operator>>(istream &is, i128 &x) { i64 v; is >> v; x = v; return is; } ostream &operator<<(ostream &os, i128 x) { os << (i64) x; return os; } istream &operator>>(istream &is, u128 &x) { u64 v; is >> v; x = v; return is; } ostream &operator<<(ostream &os, u128 x) { os << (u64) x; return os; } template > Vec sort_index(i32 n, F f, Comp comp = Comp()) { Vec idx(n); iota(ALL(idx), 0); sort(ALL(idx), [&](i32 i, i32 j) -> bool { return comp(f(i), f(j)); }); return idx; } [[maybe_unused]] constexpr i32 INF = 1000000100; [[maybe_unused]] constexpr i64 INF64 = 3000000000000000100; #ifdef FAST_IO __attribute__((constructor)) void fast_io() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); } #endif // ===== template.hpp ===== #ifdef DEBUGF #include "cpl/template/debug.hpp" #else #define DBG(x) (void) 0 #endif int main() { i32 h, w; cin >> h >> w; if (h % 2 == 0 || w % 2 == 0) { cout << (h / 2 * 2) * (w / 2 * 2) << '\n'; REP(i, h) REP(j, w) { i32 num = (i32) (i < h / 2 * 2 && j < w / 2 * 2); cout << num << " \n"[j + 1 == w]; } } i32 n = min(h, w); cout << (min(h, w) - 1) * max(h, w) << '\n'; REP(i, h) REP(j, w) { i32 num = !(i == j || (i >= n && j == w - 1) || (i == h - 1 && j >= n)); cout << num << " \n"[j + 1 == w]; } }