Frog steps either 1, 2 or 3 steps to go to top. In how many ways it reaches the top?
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N. Where is the number of steps it has to hop.
Print the number of ways.
1 ≤ T ≤ 50
1 ≤ N ≤ 50