#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  dsu d(n);
  VI val(n, -1);
  mint ans = mint(10).pow(n);
  const mint inv10 = mint(10).inv();

  auto set_val = [&](int i, int x) {
    i = d.leader(i);
    if (val[i] == -1) {
      val[i] = x;
      ans *= inv10;
    } else if (val[i] != x) {
      ans = 0;
    }
  };
  auto mrg = [&](int i, int j) {
    i = d.leader(i), j = d.leader(j);
    if (i != j) {
      int l = d.merge(i, j);
      if (val[i] == -1) {
        ans *= inv10;
        if (val[j] != -1) val[l] = val[j];
      } else if (val[j] == -1) {
        ans *= inv10;
        val[l] = val[i];
      } else if (val[i] != val[j]) {
        ans = 0;
      }
    }
  };

  while(q--) {
    string s;
    cin >> s;
    int idx[26];
    memset(idx, -1, sizeof(idx));
    rep(i, n) {
      if ('0' <= s[i] && s[i] <= '9') {
        set_val(i, s[i] - '0');
      } else if ('a' <= s[i] && s[i] <= 'z') {
        int x = s[i] - 'a';
        if (idx[x] == -1) idx[x] = i;
        else mrg(i, idx[x]);
      }
    }
    cout << ans.val() << '\n';
  }
}