Blocking Grid

Problem Statement

Blocking Grid Problem Description Tom and Alex are playing a game called "Blocking Grid". The game involves an NxN grid. Each minute, Alex blocks one cell of the grid, and Tom attempts to move from the cell (1,1) to cell (N,N). If Tom successfully reaches (N,N), Tom earns 1 point. If he cannot, Alex earns 1 point. Alex is allowed to block a total of M cells. Tom can move to adjacent cells (left, right, up, down) but cannot move to blocked cells. The player with the most points wins the game. Determine the winner. Note: The grid uses 1-based indexing. Input Format The first line contains two space-separated integers, N and M, representing the size of the grid and the number of cells Alex will block, respectively. The next M lines each contain two space-separated integers, X and Y, indicating the cell blocked by Alex on the i-th second. Output Format Print "Alex" if Alex earns more points than Tom. Print "Tom" if Tom earns more or an equal number of points compared to Alex. Constraints 1