#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define ll long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 7, P1 = 31, P2 = 37, mod =998244353;

int mul(int a, int b) {
    return (1LL * a * b) % mod;
}

int add(int a, int b) {
    a = (a + mod) % mod;
    b = (b + mod) % mod;
    return (a + b) % mod;
}

int fp(int b, int p) {
    if (b == 1 or p == 0)
        return 1;

    int ret = fp(b, p >> 1);
    ret = mul(ret, ret);

    if (p & 1)
        ret = mul(ret, b);

    return ret;
}

ll modInv(ll n) {
    return fp(n, mod - 2);
}

ll fact[N], inv[N];

void pre() {
    fact[0] = inv[0] = 1;
    for (ll i = 1; i < N; i++)
        fact[i] = (fact[i - 1] * i) % mod, inv[i] = fp(fact[i], mod - 2);
}

ll nCr(ll n, ll r) {
    return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}

ll nPr(ll n, ll r) {
    return ((fact[n] * inv[n - r])) % mod;
}

int n, m;
char arr[255][255];
int dp[8 * 8 + 8][(1 << 8) + 1][(1 << 8) + 1][2];

int solve(int i, int j, int maski, int maskp, bool found) {

    if (i == n)
        return found;

    if (j >= m) // row gded
    {
        return solve(i + 1, 0, maski, maskp, found);
    }

    int idx = (i * m + j);
    int &ret = dp[idx][maski][maskp][found];

    if (~ret)
        return ret;

    ret = 0;
    int nwi = maski;
    int nwp = maskp;
    nwi &= ~(1 << (j));
    nwp &= ~(1 << (j));
    //7ot i
    if ((arr[i][j] == 'I' || arr[i][j] == '?')) {
        ret = add(ret, solve(i, j + 1, nwi | (1 << j), nwp, found));
    }
    //7ot p
    if ((arr[i][j] == 'P' || arr[i][j] == '?')) {
        ret = add(ret, solve(i, j + 1, nwi, nwp | (1 << j), found));
    }
    // c
    if ((j + 1 < m) && (maski & (1 << (j))) && (maskp & (1 << (j + 1))) && (arr[i][j] == 'C' || arr[i][j] == '?') &&
        (arr[i][j + 1] == 'C' || arr[i][j + 1] == '?')) {

        //cc
        nwi &= ~(1 << (j + 1));
        nwp &= ~(1 << (j + 1));
        ret = add(ret, solve(i, j + 2, nwi, nwp, 1));
        if ( arr[i][j+1] == '?'){
        //cp
            ret = add(ret, solve(i, j + 2, nwi, nwp | (1 << (j+1)), found));
        //ci
            ret = add(ret, solve(i, j + 2, nwi | (1 << (j+1)), nwp, found));
        }

    } else if ((arr[i][j] == 'C' || arr[i][j] == '?')) {
        ret = add(ret, solve(i, j + 1, nwi, nwp, found));
    }
    return ret;
}

void doWork() {
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> arr[j][i];
        }
    }
    swap(m, n);
    memset(dp, -1, sizeof dp);
    cout << solve(0, 0, 0, 0, 0) << endl;
}


int main() {
    ios::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);
//    freopen("bisector.in","r",stdin);
//    freopen("bisector.out","w",stdout);
    int t = 1;
    // cout << primes.size() << endl;
    //   cin >> t;
    while (t--) {
        doWork();
    }
    return 0;
}