AGS - Aritho-geometric Series (AGS)

no tags 

Arithmetic and geometric progressions are 2 of the well known progressions in maths.

Arithmetic progression (AP) is a set in which the difference between 2 consecutive numbers is constant. For example: 1, 3, 5, 7, 9... In this series the difference between 2 numbers is 2.

Geometric progression (GP) is a set in which the ratio of 2 consecutive numbers is the same. For example: 1, 2, 4, 8, 16... In this the ratio of the numbers is 2.

What if there is a series in which we multiply a(n) by 'r' to get a(n+1) and then add 'd' to a(n+1) to get a(n+2)?

For example: let's say d = 1 and r = 2 and a(1) = 1, the series would be 1, 2, 4, 5, 10, 11, 22, 23, 46, 47, 94, 95, 190...

We add d to a(1) and then multiply a(2) with r and so on.

Your task is, given 'a', 'd' and 'r' to find the a(n) term.

since the numbers can be very large, you are required to print the numbers modulo 'mod' - mod will be supplied in the test case.

Input

First line of input will have number 't' indicating the number of test cases.

Each of the test cases will have 2 lines. The first line will have 3 numbers 'a', 'd' and 'r'. The second line will have 2 numbers 'n' and 'mod'.

a = first term of the AGS.

d = the difference element.

r = the ratio element.

n = nth term required to be found.

mod = need to print the result modulo mod

Output

For each test case print "a(n) % mod" in a separate line.

Example

Input:
2
1 1 2
13 7
2 2 2
10 8

Output:
1
6

Explanation

For the first test case the series is 1, 2, 4, 5, 10, 11, 22, 23, 46, 47, 94, 95, 190..., the 13th term is 190, and 190 % 7 = 1.

Notes

The value of a, d, r, n and mod will be less than 108 and more than 0.

For every series, the second term will be a+d and third term will be (a+d)*r, and so on.


hide comments
Vendetta: 2012-04-06 09:55:39

pls check my code.......submission id is 6726568....its running on ideone..but runtime error here...:(

Sidharth Gupta: 2012-04-06 09:55:39

@tjandra: you don't need to ;)

(Tjandra Satria Gunawan)(曾毅昆): 2012-04-06 09:55:39

TLE. calculating ((r^n-1)/(r-1))%m quickly is difficult for me...

nhs: 2012-04-06 09:55:39

@Deepak I am getting sigfpe run time error.It will be very nice of u if check my solution.submission id=6714218.

Nnavneetsinha: 2012-04-06 09:55:39

@DEVIL D does the nth term(without taking mod) fit in unsigned long long .

Devil D: 2012-04-06 09:55:39

@ Ankit - Printing -ve values

Ankit Paharia: 2012-04-06 09:55:39

@deepak s: got WA ..... can u plzz chk my solution ...submission id 6655486 !!!

Nnavneetsinha: 2012-04-06 09:55:39

@DEEPAK can you check my solution whose id is 6652146.

Devil D: 2012-04-06 09:55:39

@unidentified - the input given will fit long long .. without Mod chances are that the answer might not fit long long .

Nnavneetsinha: 2012-04-06 09:55:39

does the nth term(without taking mod) fit in long long .
@DEEPAK can you check my solution whose id is 6652146.
are all the numbers are integers??

Last edit: 2012-03-14 11:06:24

Added by:Devil D
Date:2012-03-09
Time limit:1s
Source limit:10000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own