{"raw_statement":[{"iden":"problem statement","content":"> Planning to place many PCs in his room, Takahashi has decided to write a code that finds how many PCs he can place in his room.\n\nYou are given $H$ strings $S_1,S_2,\\ldots,S_H$, each of length $W$, consisting of `.` and `T`.\nTakahashi may perform the following operation any number of times (possibly zero):\n\n*   Choose integers satisfying $1\\leq i \\leq H$ and $1 \\leq j \\leq W-1$ such that the $j$\\-th and $(j+1)$\\-th characters of $S_i$ are both `T`. Replace the $j$\\-th character of $S_i$ with `P`, and $(j+1)$\\-th with `C`.\n\nHe tries to maximize the number of times he performs the operation. Find possible resulting $S_1,S_2,\\ldots,S_H$."},{"iden":"constraints","content":"*   $1\\leq H \\leq 100$\n*   $2\\leq W \\leq 100$\n*   $H$ and $W$ are integers.\n*   $S_i$ is a string of length $W$ consisting of `.` and `T`."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$H$ $W$ \n$S_1$\n$S_2$\n$\\vdots$\n$S_H$"},{"iden":"sample input 1","content":"2 3\nTTT\nT.T"},{"iden":"sample output 1","content":"PCT\nT.T\n\nHe can perform the operation at most once.\nFor example, an operation with $(i,j)=(1,1)$ makes $S_1$ `PCT`."},{"iden":"sample input 2","content":"3 5\nTTT..\n.TTT.\nTTTTT"},{"iden":"sample output 2","content":"PCT..\n.PCT.\nPCTPC"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}