#include <bits/stdc++.h>
using namespace std;

struct dsu {
    public:
    int component_num;
    dsu() : _n(0) {}
    dsu(int n) : _n(n), component_num(n), parent_or_size(n, -1) {}
 
    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        component_num--;
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }
 
    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }
 
    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }
 
    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }
 
    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }
 
    private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

int main(){
    int w, h;
    cin >> w >> h;

    dsu uf(w + 10);

    vector<int> pow10(w + 1);
    pow10[0] = 1;
    for(int i = 0; i < w; i++)pow10[i + 1] = (pow10[i] * 10ll) % 998244353;

    while(h--){
        string s;
        cin >> s;
        vector<int> alphabet(26, -1);
        for(int i = 0; i < w; i++) {
            if(s[i] == '?') continue;
            if('0' <= s[i] && s[i] <= '9') {
                uf.merge(i, s[i] - '0' + w);
            } else {
                if(alphabet[s[i] - 'a'] == -1) alphabet[s[i] - 'a'] = i;
                else uf.merge(i, alphabet[s[i] - 'a']);
            }
        }

        bool is_zero = false;
        for(int i = 0; i < 10; i++) {
            for(int j = 0; j < i; j++) {
                is_zero |= uf.same(i + w, j + w);
            }
        }

        cout << (is_zero ? 0 : pow10[uf.component_num - 10]) << '\n';
    }
}