#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
using mint=modint998244353;
int main(){
  int h,w;
  cin>>w>>h;
  dsu uf(w+10);
  while(h--){
    string s;
    cin>>s;
    int cnt=0;
    vector<vector<int>>id(26);
    rep(i,w){
      if(s[i]=='?')cnt++;
      else if('a'<=s[i]&&s[i]<='z')id[s[i]-'a'].push_back(i);
      else uf.merge(s[i]-'0'+w,i);
    }
    rep(i,26)rep(j,(int)id[i].size()-1){
      uf.merge(id[i][j],id[i][j+1]);
    }
    bool ok=true;
    rep(i,9)reps(j,i+1,10)if(uf.same(i+w,j+w))ok=false;
    if(!ok){
      cout<<0<<endl;
      continue;
    }
    mint ans=1;
    for(auto g:uf.groups()){
      if(g.back()>=w)continue;
      else ans*=10;
    }
    cout<<ans.val()<<endl;
  }
}