Board State Review

An interview dashboard receives saved states from a simple 3 by 3 board game. The first player always writes X, the second player always writes 0, and players must alternate turns starting with X. Some board states may be finished, some may still be in progress, and some may be impossible because the move counts or winning lines do not match a legal play history. For each saved board, classify the state without reconstructing every possible game. If the first player has already won, print the first-player victory message. If the second player has already won, print the second-player victory message. If the board is full with no winner, print draw. If the game can still continue, print whose turn is next. If the board could not arise from legal alternating turns, print illegal. Input Format: The first line contains t, the number of board snapshots. Each snapshot contains exactly three strings of length three. A cell is X, 0, or . for empty. Output Format: For each snapshot, print one of: first, second, the first player won, the second player won, draw, or illegal.