Problem: 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 ≤ 105) 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: a1, a2, ..., an (1 ≤ ai ≤ 107) — the numbers that are multiplied to produce the numerator.

The third line contains m space-separated integers: b1, b2, ..., bm (1 ≤ bi ≤ 107) — 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 nout, mout must satisfy the inequality 1 ≤ nout, mout ≤ 105, and the actual values in the sets aout, i and bout, i must satisfy the inequality 1 ≤ aout, i, bout, i ≤ 107. 

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.

Examples

Input

3 2
100 5 2
50 10


Output

2 3
2 1
1 1 1


Input

4 3
2 5 10 20
100 1 3


Output

1 1
20
3

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.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

// https://codeforces.com/problemset/problem/222/C
public class Problem137C {
	public static void main(String[] args) throws Exception {

		int[] spf = smallestPrimeFactor(10000000);

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter writer = new PrintWriter(System.out);

		StringTokenizer info = new StringTokenizer(reader.readLine());
		int n = Integer.parseInt(info.nextToken());
		int m = Integer.parseInt(info.nextToken());

		int[] numerators = new int[n];
		int[] denominators = new int[m];
		int[] numeratorFactors = new int[10000001];
		StringTokenizer aT = new StringTokenizer(reader.readLine());
		for (int i = 0; i < n; i++) {
			int x = Integer.parseInt(aT.nextToken());
			numerators[i] = x;
			List<Integer> factors = factor(spf, x);
			for (int factor : factors) {
				numeratorFactors[factor]++;
			}
		}
		int[] denominatorFactors = new int[10000001];
		StringTokenizer bT = new StringTokenizer(reader.readLine());
		for (int i = 0; i < m; i++) {
			int x = Integer.parseInt(bT.nextToken());
			denominators[i] = x;
			List<Integer> factors = factor(spf, x);
			for (int factor : factors) {
				denominatorFactors[factor]++;
			}
		}

		for (int i = 0; i < n; i++) {
			for (int factor : factor(spf, numerators[i])) {
				if (denominatorFactors[factor] >= 1) {
					denominatorFactors[factor]--;
					numerators[i] /= factor;
				}
			}
		}
		for (int i = 0; i < m; i++) {
			for (int factor : factor(spf, denominators[i])) {
				if (numeratorFactors[factor] >= 1) {
					numeratorFactors[factor]--;
					denominators[i] /= factor;
				}
			}
		}

		writer.println(n + " " + m);
		for (int i = 0; i < n - 1; i++) {
			writer.print(numerators[i]);
			writer.print(' ');
		}
		writer.println(numerators[n - 1]);
		for (int i = 0; i < m - 1; i++) {
			writer.print(denominators[i]);
			writer.print(' ');
		}
		writer.println(denominators[m - 1]);

		reader.close();
		writer.close();
	}
	// spf[0] = spf[1] = -1
	// primes: spf[i] = i
	// O(n log log n)
	public static int[] smallestPrimeFactor(int n) {
		int[] spf = new int[n + 1]; // includes 0
		spf[0] = -1;
		spf[1] = -1;
		for (int i = 2; i <= n; i++) {
			spf[i] = i;
		}
		for (int i = 4; i <= n; i += 2) {
			spf[i] = 2;
		}
		for (int i = 3; i * i <= n; i += 2) {
			if (spf[i] == i) {
				// prime
				for (int j = i * i; j <= n; j += i) {
					if (spf[j] == j) {
						spf[j] = i;
					}
				}
			}
		}
		return spf;
	}
	// Remember: Factors are NOT divisors
	// O(log n)
	public static List<Integer> factor(int[] spf, int value) {
		List<Integer> factors = new ArrayList<>();
		while (value != 1) {
			factors.add(spf[value]);
			value /= spf[value];
		}
		return factors;
	}
}