MOD = 998244353

class UnionFind:
  def __init__(self, n):
    self.node = [-1 for _ in range(n)]

  def root(self, v):
    if self.node[v] < 0:
      return v

    st = []
    while self.node[v] >= 0:
      st.append(v)
      v = self.node[v]

    for u in st:
      self.node[u] = v

    return v

  def size(self, v):
    v = self.root(v)
    return (- self.node[v])

  def same(self, u, v):
    return self.root(u) == self.root(v)

  def unite(self, u, v):
    ru = self.root(u)
    rv = self.root(v)
    if ru == rv:
      return

    du = self.node[ru]
    dv = self.node[rv]
    if du <= dv:
      self.node[rv] = ru
      self.node[ru] += dv
    else:
      self.node[ru] = rv
      self.node[rv] += du

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

uf = UnionFind(w)
num = [None for _ in range(w)]
flg = True
for _ in range(h):
  qi = input()
  if not flg:
    print("0")
    continue

  idx = {}
  for j in range(w):
    if qi[j] == "?":
      continue
    elif ord("a") <= ord(qi[j]) <= ord("z"):
      if idx.get(qi[j], None) is None:
        idx[qi[j]] = j
      else:
        uf.unite(idx[qi[j]], j)
    else:
      if num[j] is None:
        num[j] = int(qi[j])
      elif num[j] != int(qi[j]):
        flg = False
        break

  if not flg:
    print("0")
    continue

  par = {}
  for v in range(w):
    r = uf.root(v)
    none_r = num[r] is None
    none_v = num[v] is None
    if not none_r and not none_v:
      if num[r] != num[v]:
        flg = False
        break
    elif none_r and not none_v:
      num[r] = num[v]
    elif not none_r and none_v:
      num[v] = num[r]

    if par.get(r, None) is None:
      par[r] = num[r]

    if not num[v] is None:
      if num[v] != par[r]:
        flg = False
        break
      else:
        par[r] = num[v]

  ans = 1
  for k, v in par.items():
    if v is None:
      ans = (ans * 10) % MOD

  print(ans)