{"problem":{"name":"Weak Takahashi","description":{"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.   Each square i","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc232_d"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $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} = $ `.`\n\n## Input\n\nInput 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}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc232_d","tags":[],"sample_group":[["3 4\n.#..\n..#.\n..##","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$."],["1 1\n.","1"],["5 5\n.....\n.....\n.....\n.....\n.....","9"]],"created_at":"2026-03-03 11:01:14"}}