#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
using namespace std;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}

const long MOD = 998244353;
const int N = 2e5 + 5;
const int oo = 1e9;
const long long ooo = 1e18;

int n, m;
char pet[10][10];
ll dp[9][9][20000][2];
ll pw3[101];

int bit(int mask, int x)
{
    return (mask/pw3[x])%pw3[x+1];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);  
    pw3[0] = 1;
    for(int i = 1; i <= 20; i++)
    {
        pw3[i] = pw3[i-1]*3;
    }


    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> pet[i][j];
            // cout << pet[i][j];
        }
        // cout << "\n";
    }
    if(pet[1][1] == 'I' || pet[1][1] == '?') 
    {
        dp[1][1][0][0] = 1;
    }
    if(pet[1][1] == 'C' || pet[1][1] == '?') 
    {
        dp[1][1][1][0] = 1;
    }
    if(pet[1][1] == 'P' || pet[1][1] == '?') 
    {
        dp[1][1][2][0] = 1;
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            for(int k = 0; k < pw3[m+1]; k++)
            {
                // cout << i << " " << j << " " << k << " " << dp[i][j][k][0] << " " << dp[i][j][k][1] << "\n";
                int mask = k;
                int _i = i;
                int _j = j+1;
                if(_j == m+1) _i = i+1, _j = 1;
                if(pet[_i][_j] == 'I' || pet[_i][_j] == '?')
                {
                    dp[_i][_j][(mask%pw3[m])*3+0][0] += dp[i][j][mask][0];
                    dp[_i][_j][(mask%pw3[m])*3+0][0] %= MOD;
                    dp[_i][_j][(mask%pw3[m])*3+0][1] += dp[i][j][mask][1];
                    dp[_i][_j][(mask%pw3[m])*3+0][1] %= MOD;
                }
                if(pet[_i][_j] == 'P' || pet[_i][_j] == '?')
                {
                    dp[_i][_j][(mask%pw3[m])*3+2][0] += dp[i][j][mask][0];
                    dp[_i][_j][(mask%pw3[m])*3+2][0] %= MOD;
                    dp[_i][_j][(mask%pw3[m])*3+2][1] += dp[i][j][mask][1];
                    dp[_i][_j][(mask%pw3[m])*3+2][1] %= MOD;
                }
                if(pet[_i][_j] == 'C' || pet[_i][_j] == '?')
                {
                    if(bit(mask,m) == 0 && bit(mask,m-1) == 1 && bit(mask,0) == 2 && _j != 1)
                    {
                        dp[_i][_j][(mask%pw3[m])*3+1][1] += dp[i][j][mask][0];
                        dp[_i][_j][(mask%pw3[m])*3+1][1] %= MOD;
                    }
                    else
                    {
                        dp[_i][_j][(mask%pw3[m])*3+1][0] += dp[i][j][mask][0];
                        dp[_i][_j][(mask%pw3[m])*3+1][0] %= MOD;
                    }
                    dp[_i][_j][(mask%pw3[m])*3+1][1] += dp[i][j][mask][1];
                    dp[_i][_j][(mask%pw3[m])*3+1][1] %= MOD;
                }
            }
        }
    }

    long ans = 0;
    for(int mask = 0; mask < pw3[m+1]; mask++)
    {
        ans += dp[n][m][mask][1];
        ans %= MOD;
    }
    cout << ans << "\n";
}