import sys
sys.setrecursionlimit(10**6)
MOD = 998244353
Num = [str(i) for i in range(10)]
W,H = map(int,input().split())
A = [-1]*(W+1)
T = [[i,1] for i in range(W+1)]
def find(x):
    if T[x][0]==x:return x
    return find(T[x][0])
def union(x,y):
    rx = find(x)
    ry = find(y)
    if rx==ry:return
    if T[rx][1]>T[ry][1]:
        T[ry][0] = rx
    elif T[rx][1]<T[ry][1]:
        T[rx][0] = ry
    else:
        T[ry][0] = rx
        T[rx][1] += T[ry][1]
ans = 1
for _ in range(H):
    Q = "-"+input().strip()
    if ans==0:
        print(ans)
        continue
    C = {}
    for i in range(1,W+1):
        if Q[i] in Num:
            ri = find(i)
            if A[ri]==-1:
                A[ri] = int(Q[i])
            elif A[ri]!=int(Q[i]):
                ans = 0
        elif Q[i]!="?":
            if Q[i] not in C:
                C[Q[i]] = []
            C[Q[i]].append(i)
    for a in C:
        i = C[a][0]
        ri = find(i)
        for j in C[a][1:]:
            rj = find(j)
            if A[ri]<0 and A[rj]>=0:
                A[ri] = A[rj]
            elif A[ri]>=0 and A[rj]<0:
                A[rj] = A[ri]
            elif A[ri]!=A[rj]:
                ans = 0
            union(ri,rj)
    flag = [0]*(W+1)
    if ans>0:
        ans = 1
        for i in range(1,W+1):
            ri = find(i)
            if A[ri]<0 and flag[ri]==0:
                ans = (ans*10)%MOD
                flag[ri] = 1
    print(ans)