#921. Grid paths with walls
You get a grid with `.` (free) and `#` (wall) cells. How many paths go from the top-left to the bottom-right if you can only move right or down?
### Input
n m, then n lines.
### Output
A number.
Examples
Input
2 2 .# ..
Output
1
Input
4 3 ... ... .#. ...
Output
4
💡 You can solve it with Python, JavaScript or blocks. Read the input line by line with input(). Don't print a question (like input("Number: ")). Print exactly what the output asks for, nothing more.