#include <bits/stdc++.h>
using namespace std;
long long pow(long long a, long long b, long long m) {
  if (a == 0) return 0;
  if (b == 0) return 1;
  long long temp = pow(a, b / 2, m);
  temp = ((temp % m) * (temp % m)) % m;
  if (b & 1) temp = ((temp % m) * (a % m)) % m;
  return temp;
}
long long string_to_num(string s) {
  stringstream num(s);
  long long x;
  num >> x;
  return x;
}
string num_to_string(long long n) {
  string s;
  while (n > 0) {
    s = char(n % 10 + '0') + s;
    n /= 10;
  }
  return ((s.length() == 0) ? "0" : s);
}
const long long MOD = 998244353;
const long long mod = 1e9 + 7;
const long long N = 1e7 + 5;
long long cnt[N], Prime[N];
vector<long long> arr1, arr2;
void seive() {
  for (long long i = 2; i < N; i++) {
    if (Prime[i] != 0) continue;
    Prime[i] = i;
    for (long long j = i * i; j < N; j += i) {
      Prime[j] = i;
    }
  }
  Prime[0] = 1;
  Prime[1] = 1;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  arr1.resize(n);
  arr2.resize(m);
  for (long long i = 0; i < n; i++) {
    cin >> arr1[i];
    long long x = arr1[i];
    while (x > 1) {
      cnt[Prime[x]]++;
      x /= Prime[x];
    }
  }
  for (long long i = 0; i < m; i++) {
    long long x;
    cin >> x;
    long long temp = 1ll;
    while (x > 1) {
      if (cnt[Prime[x]] > 0) {
        cnt[Prime[x]]--;
      } else {
        temp *= Prime[x];
      }
      x /= Prime[x];
    }
    arr2[i] = temp;
  }
  for (long long i = 0; i < n; i++) {
    long long x = arr1[i];
    long long temp = 1ll;
    while (x > 1) {
      if (cnt[Prime[x]] > 0) {
        cnt[Prime[x]]--;
        temp *= Prime[x];
      }
      x /= Prime[x];
    }
    arr1[i] = temp;
  }
  cout << n << " " << m << '\n';
  for (long long i = 0; i < n; i++) {
    cout << arr1[i] << " ";
  }
  cout << '\n';
  for (long long i = 0; i < m; i++) {
    cout << arr2[i] << " ";
  }
  cout << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  seive();
  for (long long T = 1; T <= t; T++) {
    memset(cnt, 0, sizeof(cnt));
    solve();
  }
}
