{"raw_statement":[{"iden":"problem statement","content":"Given is a string $S$ consisting of `X` and `.`.\nYou can do the following operation on $S$ between $0$ and $K$ times (inclusive).\n\n*   Replace a `.` with an `X`.\n\nWhat is the maximum possible number of consecutive `X`s in $S$ after the operations?"},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 2 \\times 10^5$\n*   Each character of $S$ is `X` or `.`.\n*   $0 \\leq K \\leq 2 \\times 10^5$\n*   $K$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$K$"},{"iden":"sample input 1","content":"XX...X.X.X.\n2"},{"iden":"sample output 1","content":"5\n\nAfter replacing the `X`s at the $7$\\-th and $9$\\-th positions with `X`, we have `XX...XXXXX.`, which has five consecutive `X`s at $6$\\-th through $10$\\-th positions.  \nWe cannot have six or more consecutive `X`s, so the answer is $5$."},{"iden":"sample input 2","content":"XXXX\n200000"},{"iden":"sample output 2","content":"4\n\nIt is allowed to do zero operations."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}