Division II
Easy Accuracy: 48.42% Submissions: 126 Points: 2

You were late in the maths class which is taught by Geek. Now to punish you, Geek gave you a problem to solve. Given four integer numbers A, B, C, and N, Geek wants you to find f(f(..........f(a))) N times. Where f(x) = ((x/b) * c) - 1.
Output can be represented as a fraction P/Q, you have to output P*Q-1 modulo 109 + 7, where Q-1 is modular multiplicative inverse of Q modulus 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 the answer.
 

Constraints:
1. 1 ≤  T ≤ 10

2. 1 ≤  A, B, C ≤  109
3. 1 ≤  N ≤  103

Example:

Input:
2
1 3 4 1
1 3 4 2
Output:
333333336
444444447

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.

Division II

Output Window