CF201E Thoroughly Bureaucratic Organization

有n个人，每个人都有一个编号，编号范围在1-n以内，每个人的编号都不相同 你每次可以去询问最多m个不同的人，他们的编号是哪些，但是你不知道编号与这m个人的对应关系 现在你需要给出最少申请多少次，可以清楚知道这n个人每个人的编号

第一行有一个整数t( 1

t行，每行一个值，对应输入的一次询问，输出最少申请多少次知道n个人的编号

In the first sample, you need to submit three requests to TBO with three different names. When you learn the appointment dates of three people out of four, you can find out the fourth person's date by elimination, so you do not need a fourth request. In the second sample you need only two requests. Let's number the persons from $ 1 $ to $ 4 $ and mention persons $ 1 $ and $ 2 $ in the first request and persons $ 1 $ and $ 3 $ in the second request. It is easy to see that after that we can clearly determine each person's appointment date regardless of the answers obtained from TBO. In the fourth sample only one person signed up for an appointment. He doesn't need to submit any requests — his appointment date is tomorrow.