SP6499 BCHOCO - Breaking Chocolates

Bored of setting problems for Bytecode, Venkatesh and Akhil decided to take some time off and started to play a game. The game is played on an R\*C bar of chocolate consisting of Black and White chocolate cells. Both of them do not like black chocolate, so if the bar consists only of black chocolate cells, it is discarded (Discarding the bar is not considered as a move). If the bar consists only of white chocolate cells, they do not break it further and the bar can be consumed at any time (Eating the bar is considered as a move). If the bar consists of both black and white chocolate cells, it must be broken down into two smaller pieces by breaking the bar along any horizontal or vertical line (Breaking the bar is considered as a move). The player who cannot make a move on any of the remaining bars loses. Assuming Venkatesh starts the game and both players are infinitely intelligent, determine who wins the game.

The first line of input contains a number 't', the number of test cases. For each testcase, first line contains two space separated integers 'R' and 'C'. The following R lines contain C space separated integers which are either 0 (White) or 1 (Black).

For each testcase output “Venkatesh wins” or “Akhil wins” (quotes for clarity).