{"problem":{"name":"World Tour Finals","description":{"content":"The programming contest World Tour Finals is underway, where $N$ players are participating, and half of the competition time has passed. There are $M$ problems in this contest, and the score $A_i$ of ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc323_c"},"statements":[{"statement_type":"Markdown","content":"The programming contest World Tour Finals is underway, where $N$ players are participating, and half of the competition time has passed. There are $M$ problems in this contest, and the score $A_i$ of problem $i$ is a multiple of $100$ between $500$ and $2500$, inclusive.\nFor each $i = 1, \\ldots, N$, you are given a string $S_i$ that indicates which problems player $i$ has already solved. $S_i$ is a string of length $M$ consisting of `o` and `x`, where the $j$\\-th character of $S_i$ is `o` if player $i$ has already solved problem $j$, and `x` if they have not yet solved it. Here, none of the players have solved all the problems yet.\nThe total score of player $i$ is calculated as the sum of the scores of the problems they have solved, plus a **bonus score** of $i$ points.  \nFor each $i = 1, \\ldots, N$, answer the following question.\n\n*   At least how many of the problems that player $i$ has not yet solved must player $i$ solve to exceed all other players' current total scores?\n\nNote that under the conditions in this statement and the constraints, it can be proved that player $i$ can exceed all other players' current total scores by solving all the problems, so the answer is always defined.\n\n## Constraints\n\n*   $2\\leq N\\leq 100$\n*   $1\\leq M\\leq 100$\n*   $500\\leq A_i\\leq 2500$\n*   $A_i$ is a multiple of $100$.\n*   $S_i$ is a string of length $M$ consisting of `o` and `x`.\n*   $S_i$ contains at least one `x`.\n*   All numeric values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\ldots$ $A_M$\n$S_1$\n$S_2$\n$\\vdots$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc323_c","tags":[],"sample_group":[["3 4\n1000 500 700 2000\nxxxo\nooxx\noxox","0\n1\n1\n\nThe players' total scores at the halfway point of the competition time are $2001$ points for player $1$, $1502$ points for player $2$, and $1703$ points for player $3$.\nPlayer $1$ is already ahead of all other players' total scores without solving any more problems.\nPlayer $2$ can, for example, solve problem $4$ to have a total score of $3502$ points, which would exceed all other players' total scores.\nPlayer $3$ can also, for example, solve problem $4$ to have a total score of $3703$ points, which would exceed all other players' total scores."],["5 5\n1000 1500 2000 2000 2500\nxxxxx\noxxxx\nxxxxx\noxxxx\noxxxx","1\n1\n1\n1\n0"],["7 8\n500 500 500 500 500 500 500 500\nxxxxxxxx\noxxxxxxx\nooxxxxxx\noooxxxxx\nooooxxxx\noooooxxx\nooooooxx","7\n6\n5\n4\n3\n2\n0"]],"created_at":"2026-03-03 11:01:14"}}