# I:{1,...,H}の部分集合,J:{1,...,W}の部分集合でI,Jのsizeが同じ組み合わせすべてに対して
# det(A') * det(B')の総和が答え.X':Iに含まれる行,Jに含まれる列としたXの部分行列.

# 解説
# コーシー・ビネの定理　https://ja.wikipedia.org/wiki/%E3%82%B3%E3%83%BC%E3%82%B7%E3%83%BC%E3%83%BB%E3%83%93%E3%83%8D%E3%81%AE%E5%85%AC%E5%BC%8F
# X = [[I,B^t],[-A,I]]とするとIだけででてくる1を引けばいい. 

mod = 998244353

def mul(A,B):
  l = len(A)
  m = len(A[0])
  n = len(B[0])
  C = [[0] * n for i in range(l)]
  for i in range(l):
    for j in range(n):
      for k in range(m):
        C[i][j] += A[i][k] * B[k][j]
        C[i][j] %= mod
  return C

def det(A):
  n = len(A)
  res = 1
  for i in range(n):
    if A[i][i] == 0:
      for j in range(i+1,n):
        if A[i][j] != 0:
          for k in range(i,n):
            A[i][k],A[j][k] = A[j][k],A[i][k]
          res *= -1
          res %= mod
          break
      if A[i][i] == 0:
        return 0
    a = A[i][i]
    res = res * a % mod
    a_inv = pow(a,mod - 2,mod)
    for j in range(i,n):
      A[i][j] = A[i][j] * a_inv % mod
    for j in range(i+1,n):
      a = A[j][i]
      for k in range(i,n):
        A[j][k] -= A[i][k] * a % mod
        A[j][k] %= mod
  return res

H,W = map(int,input().split())
A = [list(map(int,input().split())) for h in range(H)]
B = [[0 for h in range(H)] for w in range(W)]
for h in range(H):
  b = list(map(int,input().split()))
  for w in range(W):
    B[w][h] = b[w]

C = mul(A,B)
if H > W:
  C = mul(A,B)
for h in range(H):
  C[h][h] += 1
print((det(C) - 1) % mod)