#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

struct UnionFind {
    vector<int> data;
    UnionFind(int size) : data(size, -1) {}
    bool unionSet(int x, int y) {
        x = root(x); y = root(y);
        if (x != y) {
        if (data[y] < data[x]) swap(x, y);
        data[x] += data[y]; data[y] = x;
        }
        return x != y;
    }
    bool findSet(int x, int y) {
        return root(x) == root(y);
    }
    int root(int x) {
        return data[x] < 0 ? x : data[x] = root(data[x]);
    }
    int size(int x) {
        return -data[root(x)];
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int w, h; cin >> w >> h;
    vector<int> ans(w, -1);
    UnionFind uf(w);
    mint ret = 1;
    for(int i = 0; i < w; i++) ret *= 10;
    for(int i = 0; i < h; i++){
        string s; cin >> s;
        vector<vector<int>> v(26);
        for(int j = 0; j < w; j++){
            if(s[j] == '?') continue;
            if('0' <= s[j] && s[j] <= '9'){
                int x = s[j]-'0';
                int r = uf.root(j);
                if(ans[r] == -1){
                    ans[r] = x;
                    ret /= 10;
                }else{
                    if(ans[r] != x){
                        ret = 0;
                    }
                }
            }else{
                int idx = s[j]-'a';
                v[idx].push_back(j);
            }
        }
        for(int x = 0; x < 26; x++){
            for(int j = 0; j+1 < (int)v[x].size(); j++){
                int a = v[x][j], b = v[x][j+1];
                if(uf.findSet(a, b)) continue;
                int ar = uf.root(a), br = uf.root(b);
                uf.unionSet(a, b);
                int r = uf.root(a);
                if(ans[ar] == -1 && ans[br] == -1){
                    ret /= 10;
                }else if(ans[ar] == -1){
                    ans[r] = ans[br];
                    ret /= 10;
                }else if(ans[br] == -1){
                    ans[r] = ans[ar];
                    ret /= 10;
                }else{
                    if(ans[ar] != ans[br]) ret = 0;
                    ans[r] = ans[ar];
                }
            }
        }
        cout << ret << endl;
    }
   
}