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
T = int(raw_input())

K = 3
Ans = [0]*(100001)
Ans[0] = 1
Ans[1] = 1
Ans[2] = 2
Ans[3] = 4
for i in range(0,T):
	N = int(raw_input())
	if N>K:
		for j in range(K,N+1):
			Ans[j] = Ans[j-1]+Ans[j-2]+Ans[j-3]
		print Ans[N]%(1000000007)
	else:
		print Ans[N]%(1000000007)
	K = max(N,K)