301189: CF222C. Reducing Fractions
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Reducing Fractions
题意翻译
给出两个集合,第一个集合数的乘积是分子,第二个集合的数的乘积是分母,要求够造一个同样的集合,但是得到的分数是最简分数。题目描述
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.输入输出格式
输入格式
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.
输出格式
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.
输入输出样例
输入样例 #1
3 2
100 5 2
50 10
输出样例 #1
2 3
2 1
1 1 1
输入样例 #2
4 3
2 5 10 20
100 1 3
输出样例 #2
1 1
20
3