import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

# def out(s):
#     s=bin(s)[2:].zfill(h*w)
#     for i in range(h):
#         print(s[i*w:(i+1)*w])
#     print()
#
# h,w=LI()
# ss=set()
# st=[0]
# ss.add(0)
# ans=0
# while st:
#     s=st.pop()
#     for i in range(h-1):
#         for j in range(w-1):
#             if s>>i*w+j&1==0:
#                 t=s^3<<i*w+j^3<<(i+1)*w+j
#                 if t in ss:continue
#                 ss.add(t)
#                 st.append(t)
#                 bc=t.bit_count()
#                 if bc>ans:
#                     ans=bc
#                     print(bc)
#                     out(s)
#                     out(t)
#
# print(ans)

h,w=LI()
rev=0
if h>w:h,w,rev=w,h,1

ans=h*w
t=[[1]*w for _ in range(h)]
if h&1:
    if w&1:
        ans-=w
        for i in range(h):t[i][i]=0
        for j in range(h,w):t[-1][j]=0
    else:
        ans-=w
        t[0]=[0]*w
elif w&1:
        ans-=h
        for i in range(h):t[i][0]=0

if rev:t=[col for col in zip(*t)]
print(ans)
for r in t:print(*r)