#include<bits/stdc++.h>

using lint = int64_t;
using namespace std;

vector<vector<bool>> solve(int n, int m) {

  vector<vector<bool>> ans(n, vector<bool>(m));

  for(int i = 0; i < m; i += 2) {
    ans[0][i] = 1;
  }

  for(int i = 2; i < n; i += 2) {
    ans[i][0] = 1;
  }

  // if(m == 2) {
  //   ans[0][1] = 1;
  // } else if(n == 2) {
  //   ans[1][0] = 1;
  // }

  if(n % 2 == 0 or m % 2 == 0) {
    ans[n-1][m-1] = 1;
  }

  return ans;
}

int main(void) {
  cin.tie(nullptr)->sync_with_stdio(false);

  int n, m;

  cin >> n >> m;

  vector<vector<bool>> ans, ans2;

  int cnt = 0, cnt2 = 0;
  ans = solve(n, m);

  for(auto &i : ans) {
    for(int j = 0; j < i.size(); j++) {
      cnt += i[j];
    }
  }

  cout << cnt << "\n";
  for(auto &i : ans) {
    for(int j = 0; j < i.size(); j++) {
      cout << i[j] << " ";
    }
    cout << "\n";
  }


  return 0;
}