Initially, Igna distributes $1000$ balls into $30$ boxes. Then, Igna and Mica alternate turns, starting with Igna. Each player, on their turn, chooses a box and removes one ball. When a player removes the last ball from a box, they earn a coin. Find the maximum integer $k$ such that, regardless of how Mica plays, Igna can earn at least $k$ coins.