#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
    char grid[n][m];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> grid[i][j];
        }
    }
    map<string, int> dp[n][m];
    if(grid[0][0]=='I' || grid[0][0]=='?')dp[0][0]["I"] = 1;
    if(grid[0][0]=='C' || grid[0][0]=='?')dp[0][0]["C"] = 1;
    if(grid[0][0]=='P' || grid[0][0]=='?')dp[0][0]["P"] = 1;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if(i==0 && j==0)continue;
            for (auto &mask : dp[i][(j - 1)%m])
            {
                if(grid[i][j]=='I' || grid[i][j]=='?'){
                    string cur = mask.first + "I";
                    if(cur.size() > (m+1))cur = cur.substr(1);
                    dp[i][j][cur] += mask.second;
                }
                if(grid[i][j]=='P'||grid[i][j]=='?'){
                    string cur = mask.first + "P";
                    if(cur.size() > (m+1))cur = cur.substr(1);
                    dp[i][j][cur] += mask.second;
                }
                if (grid[i][j] == 'C' || grid[i][j]=='?')
                {
                    if (mask.first.size() == (m+1) &&
                    mask.first[0] == 'I' && mask.first[1] == 'C' && mask.first[m] == 'P'
                        && j != 0)
                    {
                        continue;
                    }
                    string cur = mask.first + "C";
                    if(cur.size() > (m+1))cur = cur.substr(1);
                    dp[i][j][cur] += mask.second;
                }
            }
        }
    }

    long long ret = 1;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            if(grid[i][j]=='?')ret *= 3;
        }
    }
    for(auto & i : dp[n-1][m-1]){
        ret -= i.second;
    }
    cout << ret << "\n";
}