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.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskC {
    int n;
    int m;
    int[] a;
    int[] b;
    int[] primesNum;
    int[] primesDen;
    int[][] factorsNum;
    int[][] factorsDen;
    int[] primes;
    EratosthenesPrimeFactorizer factorizer;

    int[] tmpIndices = new int[30];
    int[] tmpFactors = new int[30];
    int[] tmpPowers = new int[30];

    int[] addPrimes(int x, int[] primesTable) {
        int factorsCount = factorizer.factorizeWithPowers(x, tmpFactors, tmpPowers);
        int len = 0;
        for (int i = 0; i < factorsCount; i++) {
            int p = tmpFactors[i];
            int pow = tmpPowers[i];
            int idx = Arrays.binarySearch(primes, p);
            primesTable[idx] += pow;
            for (int j = 0; j < pow; j++)
                tmpIndices[len++] = idx;
        }
        return Arrays.copyOf(tmpIndices, len);
    }

    int fetchPrimes(int x, int[] primesTable, int[] factors) {
        int ret = x;
        for (int p : factors) {
            if (primesTable[p] > 0) {
                primesTable[p]--;
                ret /= primes[p];
            }
        }
        return ret;
    }

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int N = 10000000;
        factorizer = new EratosthenesPrimeFactorizer(N);
        primes = factorizer.getPrimes();
        primesNum = new int[primes.length];
        primesDen = new int[primes.length];
        n = in.nextInt();
        m = in.nextInt();
        a = new int[n];
        b = new int[m];
        factorsNum = new int[n][];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
            factorsNum[i] = addPrimes(a[i], primesNum);
        }
        factorsDen = new int[m][];
        for (int i = 0; i < m; i++) {
            b[i] = in.nextInt();
            factorsDen[i] = addPrimes(b[i], primesDen);
        }
        for (int i = 0; i < primesNum.length; i++)
            primesNum[i] = primesDen[i] = Math.min(primesNum[i], primesDen[i]);
        for (int i = 0; i < n; i++)
            a[i] = fetchPrimes(a[i], primesNum, factorsNum[i]);
        for (int i = 0; i < m; i++)
            b[i] = fetchPrimes(b[i], primesDen, factorsDen[i]);
        out.println(n + " " + m);
        for (int cur : a) {
            out.print(cur);
            out.print(" ");
        }
        out.println();
        for (int cur : b) {
            out.print(cur);
            out.print(" ");
        }
        out.println();
    }
}

class EratosthenesPrimeFactorizer {
    private int n;
    private int[] smallestPrimeDivisor;
    private byte[] smallestPrimeDivisorPower;
    private int[] prevNumber; // i / (spd[i] ^ spdp[i])
    private int[] primes;

    public EratosthenesPrimeFactorizer(int n) {
        this.n = n;
        build();
    }


    public int[] getPrimes() {
        return primes;
    }

    public int factorizeWithPowers(int k, int[] factors, int[] powers) {
        if (k <= 0 || k > n) throw new NumberFormatException();
        int factorsNumber = 0;
        while (k != 1) {
            factors[factorsNumber] = smallestPrimeDivisor[k];
            powers[factorsNumber++] = smallestPrimeDivisorPower[k];
            k = prevNumber[k];
        }
        return factorsNumber;
    }

    private void build() {
        // Memory allocation
        smallestPrimeDivisor = new int[n + 1];
        smallestPrimeDivisorPower = new byte[n + 1];
        prevNumber = new int[n + 1];
        primes = new int[n + 1];
        // Algorithm
        int primesCount = 0;
        smallestPrimeDivisor[1] = 1;
        for (int i = 2; i <= n; i++) {
            if (smallestPrimeDivisor[i] == 0) {
                smallestPrimeDivisor[i] = i;
                smallestPrimeDivisorPower[i] = 1;
                prevNumber[i] = 1;
                primes[primesCount++] = i;
            } else {
                int prev = i / smallestPrimeDivisor[i];
                if (smallestPrimeDivisor[prev] == smallestPrimeDivisor[i]) {
                    smallestPrimeDivisorPower[i] = (byte) (smallestPrimeDivisorPower[prev] + 1);
                    prevNumber[i] = prevNumber[prev];
                } else {
                    smallestPrimeDivisorPower[i] = 1;
                    prevNumber[i] = prev;
                }
            }
            for (int j = 0, next; j < primesCount; j++) {
                if (primes[j] > smallestPrimeDivisor[i] || (next = i * primes[j]) > n) break;
                smallestPrimeDivisor[next] = primes[j];
            }
        }
        primes = Arrays.copyOf(primes, primesCount);
    }
}

class InputReader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
}