B'This is an interactive problem. Consider an undirected connected graph consisting of n vertices and m edges. Each vertex can be colored with one of three colors: 1 , 2 , or 3 . Initially, all vertices are uncolored. Alice and Bob are playing a game consisting of n rounds. In each round, the following two-step process happens: Alice wins if there exists an edge connecting two vertices of the same color. Otherwise, Bob wins. You are given the graph. Your task is to decide which player you wish to play as and win the game. Each test contains multiple test cases. The first line contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains two integers n , m ( 1 <= n <= 10^4 , n - 1 <= m <= min( frac{n cdot (n - 1)}{2}, 10^4) ) -- the number of vertices and the number of edges in the graph, respectively. Each of the next m lines of each test case contains two integers u_i , v_i ( 1 <= u_i, v_i <= n ) -- the edges of the graph. It is guaranteed that the graph is connected and there are no multiple edges or self-loops. It is guaranteed that the sum of n and the sum of m over all test cases does not exceed 10^4 . For each test case, you need to output a single line containing either "Alice" or "Bob", representing the player you choose. Then for each of the following n rounds, the following two-step process happens: If any of your outputs are invalid, the jury will output "-1" and you will receive a Wrong Answer verdict. At the end of all n turns, if you have lost the game, the jury will output "-1" and you will receive a Wrong Answer verdict. If your program has received a -1 instead of a valid value, it must terminate immediately. Otherwise, you may receive an arbitrary verdict because your solution might be reading from a closed strea'...