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
krystianpecak:
20180119 13:44:35
elo pozdro edit. LOL Last edit: 20180119 13:50:33 

abuki123:
20180110 08:26:55
Dajcie kod mordeczki 

sm_programmer:
20170630 11:33:28
@liuxueyang Thank you for the insight :D 

rohit9934:
20170619 20:07:34
should be moved to tutorials. 

sabbirnoncoder:
20170619 16:08:24
AC in 1st go


shivam_mnnit:
20170505 20:14:05
i am getting a run time memory overflow problem . how do i solve it?? 

tasin_hoque:
20170124 07:55:12
Thank you spoj for this easy problem! 

priyance:
20161031 20:36:53
Can anyone help me solve this problem as it is creating problem while reading the inputs and bcoz of that output is coming wrong? 

peanuts3005:
20160729 08:57:43
AC in 1st go


liuxueyang:
20160716 14:47:26
AC in the 1st go in common lisp.

Added by:  kuszi 
Date:  20130826 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 