{"raw_statement":[{"iden":"problem statement","content":"There is a $H \\times W$\\-square grid with $H$ horizontal rows and $W$ vertical columns. Let $(i, j)$ denote the square at the $i$\\-th row from the top and $j$\\-th column from the left.  \nEach square is described by a character $C_{i, j}$, where $C_{i, j} = $ `.` means $(i, j)$ is an empty square, and $C_{i, j} = $ `#` means $(i, j)$ is a wall.\nTakahashi is about to start walking in this grid. When he is on $(i, j)$, he can go to $(i, j + 1)$ or $(i + 1, j)$. However, he cannot exit the grid or enter a wall square. He will stop when there is no more square to go to.\nWhen starting on $(1, 1)$, at most how many squares can Takahashi visit before he stops?"},{"iden":"constraints","content":"*   $1 \\leq H, W \\leq 100$\n*   $H$ and $W$ are integers.\n*   $C_{i, j} = $ `.` or $C_{i, j} = $ `#`. $(1 \\leq i \\leq H, 1 \\leq j \\leq W)$\n*   $C_{1, 1} = $ `.`"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$H$ $W$\n$C_{1, 1} \\ldots C_{1, W}$\n$\\vdots$\n$C_{H, 1} \\ldots C_{H, W}$"},{"iden":"sample input 1","content":"3 4\n.#..\n..#.\n..##"},{"iden":"sample output 1","content":"4\n\nFor example, by going $(1, 1) \\rightarrow (2, 1) \\rightarrow (2, 2) \\rightarrow (3, 2)$, he can visit $4$ squares.\nHe cannot visit $5$ or more squares, so we should print $4$."},{"iden":"sample input 2","content":"1 1\n."},{"iden":"sample output 2","content":"1"},{"iden":"sample input 3","content":"5 5\n.....\n.....\n.....\n.....\n....."},{"iden":"sample output 3","content":"9"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}