#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod = 98244353;

ll dp[8][6561][2];
int mp[8][8], j_vals[8];

int conv(char c){
    if(c == 'C')
        return 0;
    else if(c == 'I')
        return 1;
    else if(c == 'P')
        return 2;
    else
        return -1;
}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);

    int n, m;
    char tmp;

    cin >> n >> m;

    int m_max = pow(3, m);

    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            cin >> tmp;

            mp[i][j] = conv(tmp);
        }
    }

    for(int j = 0; j < m_max; j++){
        bool good = true;
        int tj = j;

        for(int l = 0; l < m; l++){
            j_vals[l] = tj%3;

            if(mp[0][l] != -1 && mp[0][l] != j_vals[l])
                good = false;

            tj /= 3;
        }

        if(good)
            dp[0][j][0] = 1;
        else
            dp[0][j][0] = 0;
        
        dp[0][j][1] = 0;
    }
    
    for(int i = 1; i < n; i++){
        vector<vector<int>> adds(7, vector<int>());
        ll sum0 = 0, sum1 = 0;

        for(int j = 0; j < m_max; j++){
            bool good = true;
            int tj = j;

            sum0 += dp[i-1][j][0];
            sum1 += dp[i-1][j][1];

            sum0 %= mod;
            sum1 %= mod;

            for(int l = 0; l < m; l++){
                j_vals[l] = tj%3;

                if(mp[i-1][l] != -1 && mp[i-1][l] != j_vals[l])
                    good = false;
                                
                tj /= 3;
            }

            if(good){
                for(int l = 0; l < m-1; l++){
                    if(j_vals[l] == 1 && j_vals[l+1] == 0)
                        adds[l].push_back(j);
                }                
            }
        }

        for(int j = 0; j < m_max; j++){
            bool good = true;
            int tj = j;

            for(int l = 0; l < m; l++){
                j_vals[l] = tj%3;

                if(mp[i][l] != -1 && mp[i][l] != j_vals[l])
                    good = false;
                                
                tj /= 3;
            }

            unordered_set<int> matches;

            dp[i][j][0] = dp[i][j][1] = 0;

            if(good){
                for(int l = 0; l < m-1; l++){
                    if(j_vals[l] == 2 && j_vals[l+1] == 0){
                        for(int v : adds[l]){
                            matches.insert(v);
                        }
                    }
                }  

                ll tsum0 = sum0;
                ll tsum1 = sum1;

                for(int v : matches){
                    tsum0 -= dp[i-1][v][0];
                    tsum1 -= dp[i-1][v][1];
                    dp[i][j][1] += dp[i-1][v][0] + dp[i-1][v][1];

                    tsum0 %= mod;
                    tsum1 %= mod;

                    if(tsum0 < 0)
                        tsum0 += mod;

                    if(tsum1 < 0)
                        tsum1 += mod;

                    dp[i][j][1] %= mod;
                }   

                dp[i][j][0] += tsum0;
                dp[i][j][1] += tsum1;           
            }
        }
    }

    ll ans = 0;
    
    for(int i = 0; i < m_max; i++){
        ans += dp[n-1][i][1];
        ans %= mod;
    }

    cout << ans << "\n";
}