#pragma GCC optimize ("Ofast")

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int n, m;
int grid[8][8];
const int MOD = 998244353;
ll COMBOS;
typedef vector<pair<int,bool>> V;

bool valid(int row, int vals) {
    for (int i = 0; i < m; i++) {
        int c = vals % 3;
        if (grid[row][i] != 3 && grid[row][i] != c) return false;
        vals /= 3;
    }
    return true;
}

V getClass(int vals) {
    int last = 0;
    V res;
    for (int i = 0; i < m; i++) {
        int c = vals % 3;
        if (c == 0 && last != 0) res.push_back({i, last == 1});
        vals /= 3;
        last = c;
    }
    return res;
}

bool compat(const V&top, const V&bot) {
    int j = 0;
    for (int i = 0; i < top.size(); i++) {
        while (j < bot.size() && bot[j].first < top[i].first) j++;
        if (j < bot.size() && top[i].first == bot[j].first && top[i].second && !bot[j].second) {
            return false;
        }
    }
    return true;
}

ll modpow(ll b, ll e) {
    ll ans = 1;
    for (; e; b = b * b % MOD, e /= 2) {
        if (e & 1) ans = ans * b % MOD;
    }
    return ans;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    cin >> n >> m;
    COMBOS = modpow(3, m);
    int blanks = 0;
    for (int i = 0; i < n; i++) {
        string s; cin >> s;
        for (int j = 0; j < m; j++) {
            grid[i][j] = string("CIP?").find(s[j]);
            if (grid[i][j] == 3) blanks++;
        }
    }
    vector<map<V,ll>> occ(n);
    for (int i = 0; i < COMBOS; i++) {
        for (int r = 0; r < n; r++) {
            if (valid(r, i)) {
                V cls = getClass(i);
                occ[r][cls]++;
            }
        }
    }
    for (int r = 1; r < n; r++) {
        for (auto p = occ[r].begin(); p != occ[r].end(); p++) {
            ll res = 0;
            for (auto p2 = occ[r-1].begin(); p2 != occ[r-1].end(); p2++) {
                if (compat(p2->first, p->first)) {
                    res = (res + p->second * p2->second) % MOD;
                }
            }
            p->second = res;
        }
    }
    ll total = modpow(3, blanks);
    for (auto p = occ[n-1].begin(); p != occ[n-1].end(); p++) {
        total -= p->second;
        if (total < 0) total += MOD;
    }
    cout << total << '\n';
}

/*

8 8 
????????
????????
????????
????????
????????
????????
????????
????????


*/