Geek-onacci Number ||
Easy Accuracy: 38.05% Submissions: 607 Points: 2

Geek created a random series and given a name geek-onacci series. Given four integers A, B, C, N. A, B, C represents the first three numbers of geek-onacci series. Find the Nth number of the series. The nth number of geek-onacci series is a sum of the last three numbers (summation of N-1th, N-2th, and N-3th geek-onacci numbers)

Note: The answer can be very large. So, output answer modulo 109 + 7.

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains four space-separated integers A, B, C, and N.


Output: For each test case, print Nth geek-onacci number

Constraints:
1. 1 <= T <= 102

2. 1 <= A, B, C <= 105
3. 4 <= N <= 104


Example:
Input:

3
1 3 2 4
1 3 2 5
1 3 2 6

Output:
6
11
19

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Geek-onacci Number ||

Output Window