from sys import stdin
input = stdin.readline

def op(x, y):
    if x == -1:
        return y
    else:
        return x
class UnionFind:
    def __init__(self, n, A, op):
        self.n = n
        self.parent_size = [-1]*n
        self.A = A[:]
        self.op = op
 
    def leader(self, a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self, a, b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        l, r = self.A[x], self.A[y]
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        self.A[x] = self.op(l, r)
        return 
    
    def __getitem__(self, n):
        return self.A[self.leader(n)]
    
    def update(self, n, a):
        self.A[self.leader(n)] = a
 
    def same(self, a, b):
        return self.leader(a) == self.leader(b)
 
    def size(self, a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

MOD = 998244353

def code(s):
    return ord(s)-ord("a")
def codeR(n):
    return chr(ord("a")+n)

W, H = map(int, input().split())
query = [input().rstrip("\n") for _ in range(H)]

UF = UnionFind(W, [-1]*W, op)
NG = False
ans = pow(10, W, MOD)
inv = pow(10, -1, MOD)
for q in query:
    pre = [-1]*26
    for i in range(W):
        if q[i].isdigit():
            n = int(q[i])
            if UF[i] != -1 and UF[i] != n:
                NG = True
            if UF[i] == -1:
                ans *= inv
                ans %= MOD
            UF.update(i, n)
        elif q[i].isalpha():
            n = code(q[i])
            if pre[n] != -1:
                if UF[pre[n]] != -1 and UF[i] != -1 and UF[pre[n]] != UF[i]:
                    NG = True
                if not UF.same(pre[n], i):
                    if UF[pre[n]] == -1 or UF[i] == -1:
                        ans *= inv
                        ans %= MOD
                    UF.merge(pre[n], i)
            pre[n] = i
    print(ans if not NG else 0)