Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

HS08FRAC - Fractions Decomposition

Write a program to decompose a given rational number into a sum of pairwise distinct fractions: 1/n1 + 1/n2 + ... + 1/nk, where ni are positive integers.

Input

Test cases (no more than 10 000) are given in the form

p q

where p and q are positive integers such that 1 <= p <= q <= 1 000 (p and q are separated by a single space character). After each test case, a new line character follows.

Output

For each pair p and q, decompose p/q into the sum: 1/n1 + 1/n2 + ... + 1/nk. As the result, please print only the denominators sorted from the smallest to the largest, separated by spaces. A newline character should follow the solution to each test-case.

Example 1

Input:

    2 3
    3 4
    2 5
    3 7

Output:

    2 6
    2 4
    3 15
    3 11 231

Example 2

A larger test-case: input, and corresponding output.

Scoring

By solving this problem you score 10 points.


Added by:kuszi
Date:2009-03-26
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON RUBY SCM guile SCM qobi ST TEXT WHITESPACE
Resource:High School Programming League (thanks to Robert Janczewski)

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.