#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;

//?????°?????????MOD??¢??°
inline long long imod(long long a, long long b)
{
	return (a >= 0) ? (a % b) : (a % b + b);
}

//mint_base?????¨????´??????¢??°
template <long long MOD> class mint_base;
template <long long MOD> mint_base<MOD> m_pow(mint_base<MOD> x, long long n);

//mod?¨???????????????§????????´??°???????????¬???????????????
template <long long MOD = 1000000007>
class mint_base
{
public:
	mint_base<MOD> operator+(const mint_base<MOD> &other)const
	{
		return mint_base<MOD>(imod(a + other.a, MOD));
	}
	mint_base<MOD> operator-(const mint_base<MOD> &other)const
	{
		return mint_base<MOD>(imod(a - other.a, MOD));
	}
	mint_base<MOD> operator*(const mint_base<MOD> &other)const
	{
		return mint_base<MOD>(imod(a * other.a, MOD));
	}
	mint_base<MOD> operator+=(const mint_base<MOD> &other)
	{
		a = imod(a + other.a, MOD);
		return mint_base<MOD>(a);
	}
	mint_base<MOD> operator-=(const mint_base<MOD> &other)
	{
		a = imod(a - other.a, MOD);
		return mint_base<MOD>(a);
	}
	mint_base<MOD> operator*=(const mint_base<MOD> &other)
	{
		a = imod(a * other.a, MOD);
		return mint_base<MOD>(a);
	}
	mint_base<MOD> operator+()const
	{
		return *this;
	}
	mint_base<MOD> operator-()const
	{
		return mint_base<MOD>(-a);
	}
	mint_base<MOD>& operator++()
	{
		*this += 1;
		return *this;
	}
	mint_base<MOD> operator++(int)
	{
		auto tmp = *this;
		*this += 1;
		return tmp;
	}
	mint_base<MOD>& operator--()
	{
		*this -= 1;
		return *this;
	}
	mint_base<MOD> operator--(int)
	{
		auto tmp = *this;
		*this -= 1;
		return tmp;
	}
	mint_base<MOD> operator~()const
	{
		return pow(a, e_phi - 1);
	}
	mint_base<MOD>& operator=(const mint_base<MOD> &other)
	{
		a = other.a;
		return *this;
	}
	operator long long()const
	{
		return a;
	}
	explicit operator int()const
	{
		return (int)a;
	}

	//???????????°???????????????????????´???
	static_assert(MOD >= 2, "MOD cannot be below 2.");
	mint_base(long long a_) :a(imod(a_, MOD))
	{
		if (e_phi > 0)return;
		//???????????????????°????
		e_phi = MOD;
		long long m_ = MOD;
		for (int i = 2; i * i <= m_; ++i)
		{
			if (m_ % i == 0)
			{
				e_phi = e_phi / i * (i - 1);
				for (; m_ % i == 0; m_ /= i);
			}
		}
		if (m_ != 1)e_phi = e_phi / m_ * (m_ - 1);
	}
	mint_base() :a(0) {}
private:
	static long long e_phi;
	long long a;
};

//mint_base?????¨????´??????¢??°
template<long long MOD>mint_base<MOD> m_pow(mint_base<MOD> x, long long n)
{
	mint_base<MOD> res = 1;
	while (n > 0)
	{
		if (n & 1)res *= x;
		x *= x;
		n >>= 1;
	}
	return res;
}


//mint_base??????????¨????
//O(x)???????????????????????????fact_set??¢??°?????¨?\¨?????????
template<long long MOD>mint_base<MOD> fact(mint_base<MOD> x)
{
	mint_base<MOD> res(1);
	for (long long i = 1; i <= (long long)x; ++i)
	{
		res *= i;
	}
	return res;
}

//mint_base??????????¨????
//0??????x?????§????????????set???????????????
template<long long MOD>void fact_set(std::vector<mint_base<MOD>> &set, mint_base<MOD> x = mint_base<MOD>(-1))
{
	mint_base<MOD> res(1);
	set.push_back(1);
	for (long long i = 1; i <= (long long)x; ++i)
	{
		res *= i;
		set.push_back(res);
	}
}

template<long long MOD>long long mint_base<MOD>::e_phi = -1;

//mint_base??????stream????????????
template<long long MOD> std::ostream& operator<<(std::ostream& os, mint_base<MOD> i)
{
	os << (long long)i;
	return os;
}

//mint_base??????stream???????????\???
template<long long MOD> std::istream& operator >> (std::istream& is, mint_base<MOD>& i)
{
	long long tmp;
	is >> tmp;
	i = tmp;
	return is;
}

typedef mint_base<> mint;

typedef mint_base<100000> Int;

Int ans = 1;
int n, m;
char basestr[401];
int plane[400];

Int oldm[1 << 20][2];
Int memo[1 << 20][2];

int pack_base;

Int wrap(int bs, int f)
{
	return oldm[bs][f] + oldm[bs + pack_base][f];
}

int main(void)
{
	cin >> m >> n;
	for (int k = 0; k < m; ++k)
	{
		scanf("%s", basestr + (k * n));
	}
	pack_base = 1 << (n - 2);//m_pow(Int(2), n - 2);
	for (int i = 0; i < n * m; ++i)
	{
		switch (basestr[i])
		{
		case '?':plane[i] = 7; ans *= Int(3); break;
		case 'J':plane[i] = 1; break;
		case 'O':plane[i] = 2; break;
		case 'I':plane[i] = 4; break;
		}
	}
	int maxst = 1 << (n - 1);//m_pow(Int(2), n - 1);
	for (int bs = 0; bs < maxst; ++bs)
	{
		oldm[bs][0] = oldm[bs][1] = 0;
	}
	oldm[0][0] = 0;
	oldm[0][1] = 0;
	if (plane[0] & 1)++oldm[0][1];
	if (plane[0] & 2)++oldm[0][0];
	if (plane[0] & 4)++oldm[0][0];

	for (int i = 1; i < n * m; ++i)
	{
		for (int bs = 0; bs < maxst; ++bs)
		{
			memo[bs][0] = memo[bs][1] = 0;
			if (plane[i] & 1)
			{
				if (bs % 2 == 0)memo[bs][1] += (wrap(bs / 2, 0) + wrap(bs / 2, 1));
			}
			if (plane[i] & 2)
			{
				if (bs % 2 == 1)memo[bs][0] += wrap(bs / 2, 1);
				if (bs % 2 == 0)memo[bs][0] += wrap(bs / 2, 0);
			}
			if (plane[i] & 4)
			{
				if (bs % 2 == 0)
				{
					memo[bs][0] += (oldm[bs / 2][0] + oldm[bs / 2][1]);
					if ((i + 1) % n == 0)
					{
						memo[bs][0] += (oldm[bs / 2 + pack_base][0] + oldm[bs / 2 + pack_base][1]);
					}
				}
			}
		}
		for (int bs = 0; bs < maxst; ++bs)
		{
			oldm[bs][0] = memo[bs][0];
			oldm[bs][1] = memo[bs][1];
		}
	}
	Int bad;
	for (int bs = 0; bs < maxst; ++bs)
	{
		bad += (oldm[bs][0] + oldm[bs][1]);
	}
	ans -= bad;
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 35960