SMPDIV  Divisibility
Print all integers a_{i} such that a_{i} is divisible by x and not divisible by y, where 1 < a_{i} < n < 100000.
Input
First, you are given t (t<100)  the number of test cases. In each of the following t lines, 3 integers: n x y.
You might assume also that x < n and x is not divisible by y.
Output
In each of the following t lines, numbers requested in the problem description in the separated by a single space in ascending order.
Example
Input: 2 7 2 4 35 5 12 Output: 2 6 5 10 15 20 25 30
hide comments
aaronphilip_03:
20201206 20:07:11
Easy xD 

ichbinmandeep:
20200427 14:48:06
easy one


raju_94:
20200417 10:27:21
AC is one go..:D 

codefantasy:
20200324 21:30:09
AC in 1 go :D 

proramlogo:
20200229 20:37:02
How to handle input in Java ? 

sanjeev30798:
20200102 10:52:59
AC in 1st attempt


krishp:
20191231 00:31:53
sick Last edit: 20191231 00:32:03 

denyshubh:
20191130 17:07:03
The Time complexity of this problem is O(1) !!! 

emirbek:
20190412 13:01:11
easy easy =)


chewy_9:
20190316 15:06:25
AC in first attempt... 
Added by:  kuszi 
Date:  20130826 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 