// Problem: No.2291 Union Find Estimate No.2291 联找估价
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2291
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 998244353;

const int N = 2e5 + 7;
int n, q;
int cnt;

int ans[N];

class dsu {
 private:
  vector<int> fa, sz, dis;

 public:
  void build(int N) {
    fa.resize(N + 1);
    sz.resize(N + 1);
    dis.resize(N + 1);
    for (int i = 0; i <= N; ++i) {
      fa[i] = i;
      sz[i] = 1;
    }
  }
  int find(int x) {
    if (fa[x] == x) return x;
    int root = find(fa[x]);
    dis[x] += dis[fa[x]];
    ans[x] = ans[root];
    return fa[x] = root;
  }
  void join(int x, int y) {
    x = find(x), y = find(y);
    if (x != y) {
      if (ans[x] == -1 || ans[y] == -1) ++cnt;
      fa[x] = y;
      sz[y] += sz[x];
      if (ans[y] == -1)
        ans[y] = ans[x];
      else
        ans[x] = ans[y];
    }
  }
  int size(int i) { return sz[find(i)]; }
  bool same(int x, int y) { return find(x) == find(y); }
};
namespace COM {
ll quick(ll x, ll n) {
  ll res = 1;
  while (n) {
    if (n & 1) res = (res * x) % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
ll inv(ll x) { return quick(x, mod - 2); }
ll fac[N], invfac[N];
void init() {
  fac[0] = 1;
  for (int i = 1; i < N; ++i) fac[i] = (fac[i - 1] * i) % mod;
  invfac[N - 1] = inv(fac[N - 1]);
  for (int i = N - 2; i >= 0; --i) invfac[i] = (invfac[i + 1] * (i + 1)) % mod;
}
ll C(int n, int m) {
  if (n < m || m < 0) return 0;
  return fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
}  // namespace COM
void solve() {
  cin >> n >> q;
  for (int i = 1; i <= n; i++) ans[i] = -1;
  dsu d;
  d.build(n);
  bool f = true;
  for (int i = 1; i <= q; i++) {
    array<vector<int>, 26> a;
    string str;
    cin >> str;
    for (int j = 0; j < n; j++) {
      if (str[j] >= 'a' && str[j] <= 'z') {
        a[str[j] - 'a'].pb(j + 1);
      } else if (str[j] != '?') {
        if (ans[d.find(j + 1)] != -1 && ans[d.find(j + 1)] != str[j] - '0')
          f = false;
        else if (ans[d.find(j + 1)] == -1)
          ans[d.find(j + 1)] = str[j] - '0', ++cnt;
      }
    }
    for (auto dig : a) {
      for (int j = 1; j < dig.size(); j++) {
        int x = dig.front(), y = dig[j];
        x = d.find(x), y = d.find(y);
        if (!d.same(x, y)) {
          if (ans[x] != ans[y] && (ans[x] != -1 && ans[y] != -1)) f = false;
          d.join(x, y);
        }
      }
    }
    cout << (f ? COM::quick(10, max(0, n - cnt)) : 0) << "\n";
  }
}

int main() {
  fastio;
  int t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}