Codeforces Round 137 (Div. 2)
C
Reducing Fractions
Codeforces
1800
原题
← BD →
翻译中…

To confuse the opponents, the Galactic Empire represents fractions in an unusual format. The fractions are represented as two sets of integers. The product of numbers from the first set gives the fraction numerator, the product of numbers from the second set gives the fraction denominator. However, it turned out that the programs that work with fractions in this representations aren't complete, they lack supporting the operation of reducing fractions. Implement this operation and the Empire won't forget you.

翻译中…

Input

翻译中…

The first input line contains two space-separated integers $*n*$, $*m*$ ($1 ≤ *n*, *m* ≤ 10^{5}$) that show how many numbers the first set (the numerator) and the second set (the denominator) contain, correspondingly.

翻译中…

The second line contains $*n*$ space-separated integers: $*a*_{1}, *a*_{2}, ..., *a*_{*n*}$ ($1 ≤ *a*_{*i*} ≤ 10^{7}$) — the numbers that are multiplied to produce the numerator.

翻译中…

The third line contains $*m*$ space-separated integers: $*b*_{1}, *b*_{2}, ..., *b*_{*m*}$ ($1 ≤ *b*_{*i*} ≤ 10^{7}$) — the numbers that are multiplied to produce the denominator.

翻译中…

Output

翻译中…

Print the answer to the problem in the form, similar to the form of the input data. The number of values in the sets you print $*n*_{*out*}, *m*_{*out*}$ must satisfy the inequality $1 ≤ *n*_{*out*}, *m*_{*out*} ≤ 10^{5}$, and the actual values in the sets $*a*_{*out*, *i*}$ and $*b*_{*out*, *i*}$ must satisfy the inequality $1 ≤ *a*_{*out*, *i*}, *b*_{*out*, *i*} ≤ 10^{7}$.

翻译中…

Separate the values in the lines by spaces. The printed fraction must be reduced, that is, there mustn't be such integer $*x*$ ($*x* > 1$), that the numerator and the denominator of the printed fraction are divisible by $*x*$. If there are several matching answers, print any of them.

翻译中…

Note

翻译中…

In the first test sample the numerator equals 1000, the denominator equals 500. If we reduce fraction 1000/500 by the greatest common divisor of the numerator and the denominator (by 500), we obtain fraction 2/1.

翻译中…

In the second test sample the numerator equals 2000, the denominator equals 300. If we reduce fraction 2000/300 by the greatest common divisor of the numerator and the denominator (by 100), we obtain fraction 20/3.

翻译中…

样例

Input #1
3 2
100 5 2
50 10
Output #1
2 3
2 1
1 1 1
InputCopy OutputCopy
Input #2
4 3
2 5 10 20
100 1 3
Output #2
1 1
20
3
InputCopy OutputCopy
题目信息
题号
222C
时间限制
2 s
内存限制
256 MB
标签
模拟
数学
数论
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。