from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        '''
        UnionFindクラス。nは要素数を表す。
        '''
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        '''
        要素xを含む集合の親を見つける関数。
        '''
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        '''
        要素xを含む集合と要素yを含む集合を合体する関数。
        基本的には、要素数が多い集合に統合される。
        要素数が同じときは要素yを含む集合に統合される。
        '''
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        '''
        要素xを含む集合の要素数を出す関数。
        '''
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

w, h = map(int, input().split())
mod = 998244353

D = [-1 for _ in range(w)]
UF = UnionFind(w)
G = [set([i]) for i in range(w)]
roots = set(list(range(w)))
zero = False
for i in range(h):
    q = input()
    alph_set = defaultdict(list)
    for j in range(w):
        if q[j].isdigit():
            if D[j] == -1:
                D[j] = int(q[j])
            else:
                if D[j] != int(q[j]):
                    zero = True
                    break
        elif q[j].isalpha():
            alph_set[q[j]].append(j)
    if zero:
        for j in range(i, h):
            print(0)
        break
    for L in alph_set.values():
        if len(L) == 1:
            continue
        f = L[0]
        for j in range(1, len(L)):
            if not UF.same(f, L[j]):
                froot = UF.find(f)
                lroot = UF.find(L[j])
                UF.union(f, L[j])
                root = UF.find(f)
                if root == froot:
                    roots.remove(lroot)
                    G[froot] |= G[lroot]
                    G[lroot] = None
                else:
                    roots.remove(froot)
                    G[lroot] |= G[froot]
                    G[froot] = None
    for j in range(w):
        if G[j] is None:
            continue
        num_set = set()
        for idx in G[j]:
            if D[idx] == -1:
                continue
            num_set.add(D[idx])
        if len(num_set) > 1:
            zero = True
            break
        for num in num_set:
            for idx in G[j]:
                D[idx] = num
    if zero:
        for j in range(i, h):
            print(0)
        break
    ans = 1
    for root in roots:
        if D[root] == -1:
            ans *= 10
            ans %= mod
    print(ans)