Problem: You have a large rectangular board which is divided into n × m cells (the board has n rows and m columns). Each cell is either white or black.

You paint each white cell either red or blue. Obviously, the number of different ways to paint them is 2^w, where w is the number of white cells.

After painting the white cells of the board, you want to place the maximum number of dominoes on it, according to the following rules:

  * each domino covers two adjacent cells; 
  * each cell is covered by at most one domino; 
  * if a domino is placed horizontally (it covers two adjacent cells in one of the rows), it should cover only red cells; 
  * if a domino is placed vertically (it covers two adjacent cells in one of the columns), it should cover only blue cells. 



Let the value of the board be the maximum number of dominoes you can place. Calculate the sum of values of the board over all 2^w possible ways to paint it. Since it can be huge, print it modulo 998 244 353.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 3 ⋅ 10^5; nm ≤ 3 ⋅ 10^5) — the number of rows and columns, respectively.

Then n lines follow, each line contains a string of m characters. The j-th character in the i-th string is * if the j-th cell in the i-th row is black; otherwise, that character is o.

Output

Print one integer — the sum of values of the board over all 2^w possible ways to paint it, taken modulo 998 244 353.

Examples

Input


3 4
**oo
oo*o
**oo


Output


144


Input


3 4
**oo
oo**
**oo


Output


48


Input


2 2
oo
o*


Output


4


Input


1 4
oooo


Output


9

Solution (in CPP):

Solution:
#include <cstdlib>
#include <iostream>
#include <cstdio>
#include <math.h>
#include <cstring>
#include <time.h>
#include <complex>
#include <algorithm>
#include <queue>
#include <stack>
#include <unordered_map>
#include <set>
#include <bitset>

#pragma warning(disable:4996)
#define PII std::pair<long long, long long>
#define PTT std::pair<tree *, tree *>

template<typename T> T min(T x, T y)
{
	return x < y ? x : y;
}
template<typename T> T max(T x, T y)
{
	return x > y ? x : y;
};

const long long INF = 2000000005;//00000;// autojs.org
const long long mod = 998244353;//1000000007;// 
const int MAXN = 300005;

int N, M, tot, cntr[MAXN], cntc[MAXN];
std::vector<bool> v[MAXN];
long long f[MAXN][2];

long long qpow(long long x, long long y)
{
	if (!y)
		return 1;
	long long t = qpow(x, y / 2);
	t = t * t % mod;
	return y & 1 ? t * x % mod : t;
}
void DP(bool *a, int n)
{
	static int cnt[MAXN];
	for (int i = 1; i <= n; i++)
		cnt[i] = cnt[i - 1] + !a[i];
	for (int i = 2; i <= n; i++)
	{
		f[i][0] = (f[i - 1][0] + f[i - 1][1]) % mod;
		f[i][1] = 0;
		if (!a[i])
		{
			f[i][1] += f[i - 1][0];
			if (!a[i - 1])
				f[i][1] += qpow(2, cnt[i - 2]) + f[i - 2][0] + f[i - 2][1];
			f[i][1] %= mod;
		}
	}
}

void init()
{
	static char s[MAXN];
	scanf("%d %d", &N, &M);
	for (int i = 1; i <= N; i++)
	{
		scanf("%s", s + 1);
		for (int j = 1; j <= M; j++)
		{
			v[i].push_back(s[j] == '*');
			tot += !(s[j] == '*');
			cntr[i] += !(s[j] == '*');
			cntc[j] += !(s[j] == '*');
		}
	}
}
void solve()
{
	bool tmp[MAXN];
	long long ans = 0;
	for (int i = 1; i <= N; i++)
	{
		for (int j = 0; j < M; j++)
			tmp[j + 1] = v[i][j];
		DP(tmp, M);
		ans = (ans + (f[M][0] + f[M][1]) % mod * qpow(2, tot - cntr[i]) % mod) % mod;
	}
	for (int j = 1; j <= M; j++)
	{
		for (int i = 1; i <= N; i++)
			tmp[i] = v[i][j - 1];
		DP(tmp, N);
		ans = (ans + (f[N][0] + f[N][1]) % mod * qpow(2, tot - cntc[j]) % mod) % mod;
	}
	printf("%lld\n", ans);
}

int main()
{
	init();
	solve();

	return 0;
}
/*
5 5
ooooo
ooooo
ooooo
ooooo
ooooo

*/