# 各桁の組合せは10通りか、1通りか、0通り(相反する場合)
# ある桁とある桁が同じ場合はUF.uniteする
# ということはUF.findでルートをチェックして数え上げるか
# 毎クエリでパターン数は減る

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
 
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
 
    def unite(self, x, 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):
        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())

# 各桁、そして、10個の数字をグラフ化

W, H = map(int, input().split())
mod = 998244353

UF = UnionFind(W+10)
# 0-W-1までが各桁、Wが数字0、W+1が数字1、W+9が数字9を示す

numnode = {}
for n in range(10):
    numnode[str(n)] = W+n
    
numset = set()
for n in range(10):
    numset.add(str(n))    

from collections import defaultdict

for i in range(H):
    q = input()
    dic = defaultdict(list)
    for j in range(W):
        dic[q[j]].append(j)
    #print(dic)
    for d in dic:
        if d == '?':
            continue
        if d in numset:
            for k in range(len(dic[d])):
                UF.unite(numnode[d], dic[d][k])
        else:
            if len(dic[d]) > 1:
                for k in range(1, len(dic[d])):
                    UF.unite(dic[d][0], dic[d][k])
    #print(UF.all_group_members())
    ans = 1
    for members in UF.all_group_members().values():
        if len(members) == 1 and members[0] in numset:
            continue
        
        num_count = 0
        for m in members:
            if m >= W:
                num_count += 1
        if num_count == 0:
            ans *= 10
            ans %= mod
        elif num_count == 1:
            pass
        elif num_count >= 2:
            ans *= 0
    print(ans)