#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include #include #include using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector > ; using P= pair; using vi=vector; using vvi=vector; using vll=vector; using vvll=vector; using vp=vector

; using vvp=vector; using vd=vector; using vvd =vector; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++17 -I . //cout < bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } using mint=modint998244353; using vm=vector; using vvm=vector; int mod = 998244353; vll fact, fact_inv, inv; void init_nCk(int n) { fact.resize(n+1); fact_inv.resize(n+1); inv.resize(n+1); fact[0] = fact[1] = 1; fact_inv[0] = fact_inv[1] = 1; inv[1] = 1; for (int i = 2; i<=n; i++) { fact[i] = fact[i - 1] * i % mod; inv[i] = mod - inv[mod % i] * (mod / i) % mod; fact_inv[i] = fact_inv[i - 1] * inv[i] % mod; } } ll c(int n, int k) { if(n; using vve=vector; struct UnionFind { vector par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x; else return par[x] = root(par[x]); } bool issame(int x, int y) { return root(x) == root(y); } bool unite(int x, int y) { x = root(x), y = root(y); if (x == y) return false; if (siz[x] < siz[y]) swap(x, y); par[y] = x; siz[x] += siz[y]; return true; } int size(int x) { return siz[root(x)]; } }; vll anss; string S="abcdefghijklmnopqrstuvwxyz"; void solve(int test){ int n,h; cin>> n >> h; UnionFind uf(n+10); rep(qi,h){ string s; cin >> s; vvi g(26); rep(i,n){ if(s[i]=='?')continue; int is=0; rep(j,26)if(s[i]==S[j]){ g[s[i]-'a'].push_back(i); is=1; break; } if(!is){ uf.unite(i,n+s[i]-'0'); } } rep(i,26)repi(j,1,g[i].size())uf.unite(g[i][0],g[i][j]); int is=1; rep(i,10)repi(j,i+1,10)if(uf.issame(n+i,n+j)){ anss.push_back(0); is=0; continue; } if(!is)continue; vi done(n+10); mint ans=1; rep(i,10){ done[uf.root(n+i)]=1; } rep(i,n)if(i==uf.root(i) && !done[i]){ ans*=10; } anss.push_back(ans.val()); } } //python3 expander.py main.cpp //g++ cf.cpp -std=c++17 -I . int main(){cin.tie(0);ios::sync_with_stdio(false); int t=1;//cin >> t; rep(test,t)solve(test); for(auto u:anss)cout << u << endl; }