B'This is an interactive problem. As is well known, the city "E" has never had its roads repaired in its a thousand and a half years old history. And only recently the city administration repaired some of them. It is known that in total in the city "E" there are n intersections and m roads, which can be used in both directions, numbered with integers from 1 to m . The i -th road connects intersections with numbers a_i and b_i . Among all m roads, some subset of the roads has been repaired, but you do not know which one. The only information you could get from the city 's road services is that you can get from any intersection to any other intersection by driving only on the roads that have been repaired. You are a young entrepreneur, and decided to organize a delivery service of fresh raw meat in the city "E" (in this city such meat is called "steaks", it is very popular among the locals). You have already recruited a staff of couriers, but the couriers are willing to travel only on repaired roads. Now you have to find out which roads have already been repaired. The city administration has given you the city for a period of time, so you can make different queries of one of three types: Unfortunately, the city is placed at your complete disposal for a short period of time, so you can make no more than 100 cdot m requests. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 1 ,000 ) -- the number of test cases. The description of test cases follows. The first line contains two integers n and m ( 2 <= n <= 2 ,000 , n - 1 <= m <= 2 ,000 ) --the number of intersections and roads in the city "E". Each of the following m lines describes one road. The i -th of these lines contains two integers a_i and b_i ( 1 <= a_i, b_i <= n ) -- the ends of the i -th road. It is guaranteed that no road connects'...