Scavenger Hunt

Farmer John has hidden treats for Bessie the cow at special spots around the pasture. Since smart cows make tasty milk, he has placed them so that Bessie must think to find them.

John gives Bessie two integers $P$ and $Q$. She must check every point whose x-coordinate is a divisor of $P$ and whose y-coordinate is a divisor of $Q$.

For example, if $P = 24$ and $Q = 2$, the divisors are:

• Divisors of $P = 24$: $1, 2, 3, 4, 6, 8, 12, 24$
• Divisors of $Q = 2$: $1, 2$

So Bessie must check every point $(x, y)$ where $x$ is a divisor of 24 and $y$ is a divisor of 2.

Print every point Bessie should check.

Constraints

• $1 \le P \le 6000$
• $1 \le Q \le 6000$

A single line with two space-separated integers $P$ and $Q$.

Print every distinct pair x y where $x$ is a divisor of $P$ and $y$ is a divisor of $Q$, one pair per line. Sort by $x$ in ascending order; when $x$ is equal, sort by $y$ in ascending order.