THREENUMBERS - nth number

Given two numbers a and b, you have to find n-th number which is divisible by a or b.

Input

First line contains an integer T (<= 100000), denoting number of test cases.

Second line contains 3 positive integers a, b and n. (a, b <= 10000, n <= 1000000000)

Output

Print n-th number in a new line.

Example

Input:
1
2 3 10

Output:
15

Added by:surayans tiwari
Date:2017-09-09
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:SELF

hide comments
2017-09-09 16:31:32
Test cases are correct! but this problem is copied directly :| ,plz make something by atleast some modifications :)
2017-09-09 15:57:41 testing java
My guess is that the actual number of tests is smaller than given t. If my reader does not blow up in such case, I have WA (as I'm printing nothing or some rubbish), otherwise i have NZEC. It may be the case that my program is faulty (hence WA), however I think, that there may be something wrong with the input (as change in handling cases which should not happen, change status of my submission).
2017-09-09 15:19:48 wisfaq
I'm getting runtime error. (both in Python and in FPC)
If I test for a=0 or b=0 or n=0 and if so output 0 then I get wrong answer.
Clearly there is something wrong with the input file(s).
2017-09-09 12:07:20 [Rampage] Blue.Mary
Agree with @devilwolverine. The test cases are either wrong or not satisfying the input constraints.

@BlueMary: Fixed

Last edit: 2017-09-09 12:13:02
2017-09-09 11:42:50 Vipul Srivastava
are the test cases correct?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.