A group of friends has just played a round of miniature golf. Miniature golf courses consist of a number of holes. Each player takes a turn to play each hole by hitting a ball repeatedly until it drops into the hole. A player’s score on that hole is the number of times they hit the ball. To prevent incompetent players slowing down the game too much, there is also an upper limit $l$ (a positive integer) on the score: if a player has hit the ball $l$ times without the ball dropping into the hole, the score for that hole is recorded as $l$ and that player’s turn is over. The total score of each player is simply the sum of their scores on all the holes. Naturally, a lower score is considered better. There is only one problem: none of the players can remember the value of the integer $l$. They decide that they will not apply any upper limit while playing, allowing each player to keep playing until the ball drops into the hole. After the game they intend to look up the value of $l$ and adjust the scores, replacing any score on a hole that is larger than $l$ with $l$. The game has just finished, but the players have not yet looked up $l$. They wonder what their best possible ranks are. For this problem, the rank of a player is the number of players who achieved an equal or lower total score after the scores are adjusted with $l$. For example, if the adjusted scores of the players are $3, 5, 5, 4$ and $3$, then their ranks are $2, 5, 5, 3$ and $2$ respectively. Given the scores of the players on each hole, determine the smallest possible rank for each player. \InputFile The first line contains two integers $p$ and $h$, where $p~(2 \le p \le 500)$ is the number of players and $h~(1 \le h \le 50)$ is the number of holes. The next $p$ lines each contain $h$ positive integers. The $j$-th number on the $i$-th of these lines is the score for player $i$ on hole $j$ and does not exceed $10^9$. \OutputFile Output a line with the minimum possible rank for each player, in the same order as players are listed in the input.