spoj SMPDIV - Divisibility

Print all integers ai such that ai is divisible by x and not divisible by y, where 1 < ai < 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 435 5 12Output:2 6 5 10 15 20 25 30

比较简单，直接贴代码

import sysdebug = Falseif debug:    stdin = sys.stdin;    fin = open('f:/oj/uva_in.txt', 'r')    sys.stdin = fint = int(sys.stdin.readline())while (t > 0):    line = sys.stdin.readline()    data = line.strip().split(' ')    n = int(data[0])    x = int(data[1])    y = int(data[2])        first = True    for i in range(x, n, x):        if (first):            first = False        else:            print(' ', end='')                    if (i % y != 0):            print(i, end='')    print()        t = t - 1    if debug:    sys.stdin = stdin