#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int main() {
  int M, N;
  for (; ~scanf("%d%d", &M, &N); ) {
    vector<vector<int>> a(M, vector<int>(N, 0));
    for (int i = 0; i < M && i < N; ++i) {
      a[i][i] = 1;
    }
    if (M < N) {
      for (int i = M - 1; i < N; i += 2) {
        a[M - 1][i] = 1;
      }
      a[M - 1][N - 1] = 1;
    } else if (M > N) {
      for (int i = N - 1; i < M; i += 2) {
        a[i][N - 1] = 1;
      }
      a[M - 1][N - 1] = 1;
    }
    
    int ans = 0;
    for (int x = 0; x < M; ++x) for (int y = 0; y < N; ++y) {
      ans += a[x][y];
    }
    
    printf("%d\n", ans);
    for (int x = 0; x < M; ++x) {
      for (int y = 0; y < N; ++y) {
        if (y) printf(" ");
        printf("%d", a[x][y]);
      }
      puts("");
    }
  }
  return 0;
}