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
ans=[0]*100005

arr=[0]*100005
m=10**9+7
arr[0]=1;arr[1]=1;arr[2] = 2
ans[0]=1;ans[1]=1;ans[2] = 2
for i in xrange (3,100000+1):
	arr[i] = (arr[i-1]+arr[i-2]+arr[i-3])%m
	#ans.append(arr[i])
for _ in xrange(input()):
	n=int(input())
	print arr[n]