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
ans = 1

def propagate(u, v):
  none_u = num[u] is None
  none_v = num[v] is None
  if not none_u and not none_v:
    if num[u] != num[v]:
      flg = False
      return False
  elif none_u and not none_v:
    num[u] = num[v]
  elif none_v and not none_u:
    num[v] = num[u]

  return True

for _ in range(h):
  qi = input()
  ans = 1
  if not flg:
    ans = 0

  idx = {}
  for j in range(w * ans):
    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)
        r = uf.root(j)
        if not propagate(r, j):
          ans = 0
          break
    else:
      if num[j] is None:
        num[j] = int(qi[j])
      elif num[j] != int(qi[j]):
        flg = False
        ans = 0
        break

  par = {}
  for v in range(w * ans):
    r = uf.root(v)

    if not propagate(r, v):
      ans = 0
      break

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

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

  print(ans)