import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]


def main():
    H,W = map(int,input().split())
    
    if H%2 == 0 or W%2 == 0:
        A = [[0]*W for _ in range(H)]
        for i in range((H//2)*2):
            for j in range((W//2)*2):
                A[i][j] = 1
    else:
        A = [[1]*W for _ in range(H)]
        for i in range(min(H,W)):
            A[i][i] = 0
        if H > W:
            for i in range(W,H):
                #print(i,W-1)
                A[i][W-1] = 0
        else:
            for i in range(H,W):
                A[H-1][i] = 0

    ans = 0
    for i in range(H):
        for j in range(W):
            ans += A[i][j]
    print(ans)
    for i in range(H):
        print(*A[i])



if __name__ == '__main__':
    main()