CF222C.Reducing Fractions

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 nn , mm ( 1<=n,m<=1051<=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 nn space-separated integers: a1,a2,...,ana_{1},a_{2},...,a_{n} ( 1<=ai<=1071<=a_{i}<=10^{7} ) — the numbers that are multiplied to produce the numerator.

The third line contains mm space-separated integers: b1,b2,...,bmb_{1},b_{2},...,b_{m} ( 1<=bi<=1071<=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 nout,moutn_{out},m_{out} must satisfy the inequality 1<=nout,mout<=1051<=n_{out},m_{out}<=10^{5} , and the actual values in the sets aout,ia_{out,i} and bout,ib_{out,i} must satisfy the inequality 1<=aout,i,bout,i<=1071<=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 xx ( x>1x>1 ), that the numerator and the denominator of the printed fraction are divisible by xx . 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
    

说明/提示

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.

首页