#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], k_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++){
        for(int j = 0; j < m_max; j++){
            dp[i][j][0] = 0;
            dp[i][j][1] = 0;

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

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

                    if(mp[i][l] != -1 && mp[i][l] != j_vals[l]){
                        good = false;
                        break;
                    }

                    if(l > 0 && j_vals[l] == 0 && j_vals[l-1] == 2 && k_vals[l] == 0 && k_vals[l-1] == 1){
                        match = true;
                        break;
                    }

                    tj /= 3;
                    tk /= 3;
                }

                if(good){
                    if(match){
                        dp[i][j][1] += dp[i-1][k][0] + dp[i-1][k][1];
                    }else{
                        dp[i][j][0] += dp[i-1][k][0];
                        dp[i][j][1] += dp[i-1][k][1];
                    }

                    dp[i][j][0] %= mod;
                    dp[i][j][1] %= mod;
                }else{
                    break;
                }
            }                   
        }
    }

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

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