B'You 've got a table of size n xe2 x80 x89 xc3 x97 xe2 x80 x89m. We 'll consider the table rows numbered from top to bottom 1 through n, and the columns numbered from left to right 1 through m. Then we 'll denote the cell in row x and column y as (x, xe2 x80 x89y). Initially cell (1, xe2 x80 x891) contains two similar turtles. Both turtles want to get to cell (n, xe2 x80 x89m). Some cells of the table have obstacles but it is guaranteed that there aren 't any obstacles in the upper left and lower right corner. A turtle (one or the other) can go from cell (x, xe2 x80 x89y) to one of two cells (x xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89y) and (x, xe2 x80 x89y xe2 x80 x89+ xe2 x80 x891), as long as the required cell doesn 't contain an obstacle. The turtles have had an argument so they don 't want to have any chance of meeting each other along the way. Help them find the number of ways in which they can go from cell (1, xe2 x80 x891) to cell (n, xe2 x80 x89m). More formally, find the number of pairs of non-intersecting ways from cell (1, xe2 x80 x891) to cell (n, xe2 x80 x89m) modulo 1000000007 (109 xe2 x80 x89+ xe2 x80 x897). Two ways are called non-intersecting if they have exactly two common points -- the starting point and the final point. The first line contains two integers n, xe2 x80 x89m (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89m xe2 x80 x89 xe2 x89 xa4 xe2 x80 x893000). Each of the following n lines contains m characters describing the table. The empty cells are marked by characters ".", the cells with obstacles are marked by "#". It is guaranteed that the upper left and the lower right cells are empty. In a single line print a single integer -- the number of pairs of non-intersecting paths from cell (1, xe2 x80 x891) to cell (n, xe2 x80 x89m) modulo 1000000007 (109 xe2 x80 x89+ xe2 x80 x897).'...