#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int inv(int x) {
    return bp(x, mod - 2);
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<string> s(n);
    ll A = 1;
    for (int i=0;i<n;i++)
    {
        cin >> s[i];
        for (int j=0;j<m;j++)
        {
            if (s[i][j]=='?') A = A*3%mod;
        }
    }
    vector<int> p3(m+2);
    p3[0] = 1;
    for (int i=0;i<=m;i++) p3[i+1] = p3[i]*3;
    int sz = p3[m+1];
    vector<int> dp(sz);
    dp[0] = 1;
    vector<char> ch = {'I','P','C'};
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<m;j++)
        {
            vector<int> dp2(sz);
            for (int w=0;w<3;w++)
            {
                if (s[i][j]!=ch[w] and s[i][j]!='?') continue;
                for (int M=0;M<sz;M++)
                {
                    if (j!=0 and M%3==0 and M/3%3==2 and w==2 and M/p3[m]==1) continue;
                    int M2 = M+sz*w;
                    dp2[M2/3] = (dp2[M2/3]+dp[M])%mod;
                }
            }
            dp = dp2;
        }
    }
    for (int i=0;i<sz;i++) A = (A-dp[i]+mod)%mod;
    cout << A << "\n";
}

int main() {
//#ifdef DEBUG
//    freopen("input.txt", "r", stdin);
//#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}