1. def solution(m,n,matrix,in3,begin):
    3.     a = []  # 标记已经参观过的是热门还是普通
    4.     ans=[]
    5.     hashtable = []
    7.     def route(i, j,k):
    8.         hashtable.append((i, j))
    9.         a.append(k)
    10.         if matrix[i][j] != k:
    11.             return
    12.         if len(a) == n * m:
    13.             ans.append(1)
    14.             return
    15.         dd=in3[len(a)]
    16.         for x, y in ((i+1,j),(i-1,j),(i,j-1),(i,j+1)):
    17.             if 0 <= x < n and 0 <= y < m and (x, y) not in hashtable:
    19.                     route(x, y, dd)
    20.                     hashtable.pop()
    21.                     a.pop(-1)
    22.         return
    24.     for i in (0,n-1):
    25.         for j in range(m):
    26.             route(i,j,begin)
    27.             if hashtable!=[]:
    28.                 hashtable.pop()
    29.             if a!=[]:
    30.                 a.pop(-1)
    32.     for j in (0,m-1):
    33.         for i in range(1,n-1):
    34.             route(i,j,begin)
    35.             if hashtable!=[]:
    36.                 hashtable.pop()
    37.             if a!=[]:
    38.                 a.pop(-1)
    39.     return len(ans)
    41. in1 = input().split(' ')
    42. n = int(in1[0])
    43. m = int(in1[1])
    44. matrix = [[0] * m for _ in range(n)]
    45. for i in range(n):
    46.     in2 = input().split(' ')
    47.     matrix[i] = in2
    48. matrix=[[int(x) for x in matrix[i]]for i in range(n)]
    49. in3 = input().split(' ')
    50. in3=[int(x) for x in in3]
    52. begin = in3[0]
    54. if sum(sum(matrix[i]) for i in range(n))!=sum(in3):
    55.     print(0)
    56. else:
    57.     ans=solution(m,n,matrix,in3,begin)
    58.     print(ans% 11192869)