#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const ll INF = 1e18;

const int MOD = 998244353;

struct RowAssign {
    int mp; 
    int mc;  
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> g(n);
    for (auto &s : g) cin >> s;

    unordered_map<char, int> cmap = { {'C', 0}, {'I', 1}, {'P', 2} };

    int tot_states = pow(3, m);
    vector<RowAssign> assgn(tot_states);

    for (int s = 0; s < tot_states; s++) {
        int tmp = s, mp = 0, mc = 0;
        for (int j = 0; j < m; j++) {
            int v = tmp % 3;
            tmp /= 3;
            if (j < m - 1) {
                int next_v = tmp % 3;
                if (v == 1 && next_v == 0) mp |= (1 << j);
                if (v == 2 && next_v == 0) mc |= (1 << j);
            }
        }
        assgn[s].mp = mp;
        assgn[s].mc = mc;
    }

    vector<ll> dp_prev(128, 0); 
    for (int s = 0; s < tot_states; s++) {
        bool valid = true;
        int tmp = s;
        for (int j = 0; j < m; j++) {
            if (g[0][j] != '?' && cmap[g[0][j]] != (tmp % 3)) {
                valid = false;
                break;
            }
            tmp /= 3;
        }
        if (valid) {
            dp_prev[assgn[s].mp]++;
            dp_prev[assgn[s].mp] %= MOD;
        }
    }

    for (int r = 1; r < n; r++) {
        vector<ll> dp_curr(128, 0);
        for (int p = 0; p < 128; p++) {
            if (dp_prev[p] == 0) continue;
            for (int s = 0; s < tot_states; s++) {
                bool valid = true;
                int tmp = s;
                for (int j = 0; j < m; j++) {
                    if (g[r][j] != '?' && cmap[g[r][j]] != (tmp % 3)) {
                        valid = false;
                        break;
                    }
                    tmp /= 3;
                }
                if (!valid) continue;
                if ((p & assgn[s].mc) != 0) continue;
                dp_curr[assgn[s].mp] += dp_prev[p];
                if (dp_curr[assgn[s].mp] >= MOD) dp_curr[assgn[s].mp] -= MOD;
            }
        }
        dp_prev = move(dp_curr);
    }

    ll A = 0;
    for (int p = 0; p < 128; p++) {
        A = (A + dp_prev[p]) % MOD;
    }

    int k = 0;
    for (int r = 0; r < n; r++) {
        for (int j = 0; j < m; j++) {
            if (g[r][j] == '?') k++;
        }
    }

    auto powmod = [&](ll base, ll exp, ll mod) -> ll {
        ll res = 1;
        base %= mod;
        while (exp > 0) {
            if (exp & 1) res = res * base % mod;
            base = base * base % mod;
            exp >>= 1;
        }
        return res;
    };
    ll T = powmod(3, k, MOD);

    ll ans = (T - A + MOD) % MOD;
    cout << ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;

    while(t--){
        solve();
    }
    
    return 0;
}