#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using vl = vector<ll>;
#define sz(c) ll((c).size())
#define FOR(i, a, b) for(ll i=(a);i<(b);i++)

#define all(c) begin(c),end(c)
#define pb push_back
#define FORD(i, a, b) for(ll i=(b)-1;i>=(a);i--)
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define xx first
#define yy second
#define TR(X) ({if(1) cerr << "TR: " << (#X) << " = " << (X) << endl;})

const ll MOD = 998'244'353;

ll mp(char c) {
    if (c == 'I') return 0;
    if (c == 'C') return 1;
    if (c == 'P') return 2;
    return -1;
}

int main() {
    cin.sync_with_stdio(0);
    cin.tie(0);

    ll n, m;
    cin >> n >> m;
    vector<string> field(n);
    for (auto &s: field) cin >> s;

    vl pot(m + 2);
    pot[0] = 1;
    FOR(i, 1, sz(pot)) pot[i] = 3 * pot[i - 1];

    vector<string> starts = {""};
    FOR(i, 0, m) {
        vector<string> next;
        vector<char> poss = {'I', 'C', 'P'};
        for (auto s: starts) {
            if (field[0][i] != '?')
                poss = {field[0][i]};
            for (char c: poss) {
                string sx = s + c;
                next.pb(sx);
            }
        }
        starts = next;
    }
    vector<string> next;
    vector<char> nec = {'I', 'C', 'P'};
    for (auto s: starts) {
        if (field[1][0] != '?')
            nec = {field[1][0]};
        for (char c: nec) {
            string sx = s + c;
            next.pb(sx);
        }
    }
    starts = next;

    vl poss(pot[m + 1]), non(pot[m + 1]);
    for (string s: starts) {
        ll val = 0;
        FOR(i, 0, m + 1) {
            val *= 3;
            val += mp(s[i]);
        }
        poss[val] = 1;
        non[val] = 1;
    }

    FOR(i, 1, n) FOR(j, 0, m) {
            if(i == 1 && j == 0)
                continue;
            vector<char> ne = {'I', 'C', 'P'};
            if (field[i][j] != '?')
                ne = {field[i][j]};

            vl nextPoss(pot[m + 1]), nextNon(pot[m + 1]);
            FOR(val, 0, pot[m + 1]) {
                for(char c : ne){
                    ll nextVal = (val * 3) % pot[m + 1] + mp(c);
                    if(j == 0 || c != 'C' || mp('P') != val % 3 || mp('I') != val / pot[m] || mp('C') != (val % pot[m]) / pot[m - 1]){
                        nextNon[nextVal] = (nextNon[nextVal] + non[val]) % MOD;
                    }
                    nextPoss[nextVal] = (nextPoss[nextVal] + poss[val]) % MOD;
                }
            }

            poss = nextPoss;
            non = nextNon;
        }

    ll ans = 0;
    ll sum = 0;
    FOR(i, 0, pot[m + 1]) ans += poss[i] - non[i];
    ans = ((ans % MOD) + MOD) % MOD;
    cout << ans << endl;
}