A frog jumps either 1, 2 or 3 steps to go to top. In how many ways can it reach the top.
The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each testcase contains one line of input N denoting the total number of steps.
For each testcase, in a new line, print the number of ways to reach the top.
1 ≤ T ≤ 100
1 ≤ N ≤ 50
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.