Sphere Online Judge

SPOJ Problem Set (classical)

10966. Aritho-geometric Series (AGS)

Problem code: AGS

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

Arithmatic progression(AP) is a set in which the difference between 2 numbers in constant. for eg, 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 same. for eg, 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 eg .. lets say d=1 and r=2 and a(1) = 1..

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'  &  'r' to find the a(n) term .

sicne the numbers can be very large , you are required to print the numbers modulo 'mod' - mod will be supplied int 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

firts line will have 3 numbers 'a' ,'d'  and   'r'

2nd line will have 2 numbers 'n' & '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


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

Note - the value of a , d , r , n & mod will be less than 10^8 and more than 0.
for every series 2nd term will be a+d and third term will be (a+d)*r .. and so on ..

Added by:Devil D
Date:2012-03-09
Time limit:0.5s
Source limit:10000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All
Resource:Own

hide comments
2013-04-26 07:55:43 Ouditchya Sinha
My python solution works on ideone but here it's showing NZEC error. Please check my submission ( ID : 9163108 ). Code on ideone : http://ideone.com/usVSHn
2013-03-07 08:01:41 Arpit Temani
getting wa
plz check solution
http://ideone.com/UPejAt
2013-03-02 05:29:08 Utkarsh Shahdeo
I Feel like the king of the world!!!!\m/ \m/ \m/!!!
2013-02-07 19:33:57 Atul Vaibhav
any typical test case please. Getting WA!
2013-02-01 08:22:10 Mukul Jindal
Getting WA in the 5th case, can anyone suggest something where I am going wrong?
2013-01-19 22:08:48 yaswanth
I am getting WA at 5th case.
plz check my soln
http://ideone.com/rvLvtu
2013-01-15 08:15:54 Ritam Shukla
Nice problem this! :)
2013-01-07 14:32:57 Anshul Singhal
how do i use modulus in case of division?
2012-12-22 20:41:01 Paul Draper
@15972125841321, solution probably cannot depend on modular multiplicative inverses existing.
2012-09-27 11:56:21 adhikari vushesh babu
@Devil D:please tell where is my code going wrong,it is showing correct answer in ideone 7732287
SPOJ © 2013 Sphere Research Labs. All Rights Reserved.