class DisjointSetUnion(): def __init__(self, n): self.n = n self.par_or_size = [-1] * n def merge(self, a, b): assert(0 <= a < self.n) assert(0 <= b < self.n) la = self.leader(a) lb = self.leader(b) if la == lb: return la if -self.par_or_size[la] < -self.par_or_size[lb]: la, lb = lb, la self.par_or_size[la] += self.par_or_size[lb] self.par_or_size[lb] = la return la def same(self, a, b): assert(0 <= a < self.n) assert(0 <= b < self.n) return self.leader(a) == self.leader(b) def leader(self, a): assert(0 <= a < self.n) if (self.par_or_size[a] < 0): return a else: self.par_or_size[a] = self.leader(self.par_or_size[a]) return self.par_or_size[a] def size(self, a): assert(0 <= a < self.n) return - self.par_or_size[self.leader(a)] def group(self): result = dict() for a in range(self.n): la = self.leader(a) if la not in result: result[la] = [] result[la].append(a) return result MOD = 998244353 W, H = map(int, input().split()) dsu = DisjointSetUnion(W + 10) cnt = W + 10 for i in range(H): Q = input() ls = [-1] * 26 for j in range(W): if Q[j] == '?': continue elif ord('0') <= ord(Q[j]) <= ord('9'): if not dsu.same(j, W + int(Q[j])): cnt -= 1 dsu.merge(j, W + int(Q[j])) else: prev = ls[ord(Q[j]) - ord('a')] if prev != -1: if not dsu.same(j, prev): cnt -= 1 dsu.merge(j, prev) ls[ord(Q[j]) - ord('a')] = j ans = 1 for i in range(9): for j in range(i + 1, 10): if dsu.same(W + i, W + j): ans = 0 break if ans: ans = pow(10, cnt - 10, MOD) print(ans)