2022-2023 ICPC, NERC, Northern Eurasia Onsite (Unrated, Online Mirror, ICPC Rules, Teams Preferred) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

combinatorics

flows

graph matchings

greedy

*2600

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Dominoes

time limit per test

3 secondsmemory limit per test

1024 megabytesinput

standard inputoutput

standard outputDora likes to play with dominoes. She takes $$$n \times m$$$ table, marks some cells as occupied, and then tries to fill all unoccupied cells with $$$2 \times 1$$$ dominoes.

Her little brother Dani loves to play pranks on his older sister. So when she is away, he marks two more unoccupied cells as occupied. He wants to do it in such a way that it will be impossible to fill all unoccupied cells with dominoes.

Help Dani to count the number of ways he can select these two cells. Since Dani can only count to one million, if this number of ways is $$$x$$$, output $$$\min(x, 10^6)$$$.

Input

The first line contains integers $$$n$$$ and $$$m$$$ ($$$1\le n, m\le 1000$$$). Next $$$n$$$ lines contain $$$m$$$ characters each — the initial state of the table. Character "#" corresponds to an occupied cell, and character "." corresponds to an unoccupied cell. It is guaranteed that there are at least two unoccupied cells, and that it is possible to fill all unoccupied cells with dominoes.

Output

Let $$$x$$$ be the number of ways Dani can mark two cells in such a way that it will be impossible to fill all unoccupied cells with dominoes.

Print one integer $$$\min(x, 10^6)$$$.

Examples

Input

3 6 ...#.. ...... #...##

Output

52

Input

2 2 .. ..

Output

2

Input

2 2 #. #.

Output

0

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/21/2024 11:44:41 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|