Gopal is climbing the stairs. He can jump 1 or 2 or 3 steps at a time.
He wants to climb N steps. In how many ways can he reach the Nth step?
As the answer can be too large Output it modulo 10^9+7.

Input:
First line of the input contains an integer T denoting the number of test cases.
Then T lines follow each line containing an integer N.

Output:
Output the required answer in a new line for each test case.

Constraints:
1 ≤ N ≤ 10^5

Sample Input
2
3
4

Sample Output
4
7

Explanation:
Test case: 2
There 7 ways of reaching 4^th step in the stairs:-

1+1+1+1
1+1+2
1+2+1
2+1+1
1+3
3+1
2+2SAMPLE INPUT
2
3
4

SAMPLE OUTPUT
4
7
memo = [0]*100000
memo[0] = 0
memo[1] = 1
memo[2] = 2
memo[3] = 4
count = 3
for t in range(int(raw_input())):
	n = int(raw_input())
	for i in range(count+1, n+1):
		memo[i] = (memo[i-1] + memo[i-2] + memo[i-3])%1000000007
		count += 1
	print memo[n]