CF809B Glad to see you!

This is an interactive problem. In the output section below you will see the information about flushing the output. On Sunday Leha the hacker took Nura from the house where she lives and went with her to one of the most luxurious restaurants in Vičkopolis. Upon arrival, they left the car in a huge parking lot near the restaurant and hurried inside the building. In the restaurant a polite waiter immediately brought the menu to Leha and Noora, consisting of $ n $ dishes. It is interesting that all dishes in the menu are numbered with integers from $ 1 $ to $ n $ . After a little thought, the girl ordered exactly $ k $ different dishes from available in the menu. To pass the waiting time while the chefs prepare ordered dishes, the girl invited the hacker to play a game that will help them get to know each other better. The game itself is very simple: Noora wants Leha to guess any two dishes among all ordered. At the same time, she is ready to answer only one type of questions. Leha can say two numbers $ x $ and $ y $ $ (1

There are two numbers $ n $ and $ k $ $ (2

If you want to provide an answer, output a string of the form $ 2 $ $ x $ $ y $ $ (1

There are three dishes in sample. Noora ordered dished numberes $ 2 $ and $ 3 $ , which Leha should guess. If Noora receive requests for the first dish ( $ x=1 $ ), then she'll choose the second dish ( $ a=2 $ ) as the dish with the minimum value . For the second ( $ x=2 $ ) and the third ( $ x=3 $ ) dishes themselves will be optimal, because in that case . Let Leha asks Noora about the next couple of dishes: - $ x=1 $ , $ y=2 $ , then he'll recieve «NIE» answer, because $ |1-2|>|2-2| $ - $ x=2 $ , $ y=1 $ , then he'll recieve «TAK» answer, because $ |2-2|