#include <bits/stdc++.h>
using namespace std;
inline void getarrint0(vector<int>& a, int n, istream& in) {
  for (int i = 0; i <= n - 1; i++) in >> a[i];
}
vector<int> linearSievePrimes(int upper) {
  vector<int> lp(upper + 1, 0);
  vector<int> primes;
  for (int i = 2; i <= upper; i++) {
    if (lp[i] == 0) {
      lp[i] = i;
      primes.push_back(i);
    }
    for (int j = 0;
         j < (int)primes.size() && primes[j] <= lp[i] && i * primes[j] <= upper;
         j++) {
      lp[i * primes[j]] = primes[j];
    }
  }
  return lp;
}
vector<int> lp;
class Solution {
 public:
  void solve(std::istream& in, std::ostream& out) {
    int n, m;
    in >> n >> m;
    vector<int> a(n), b(m);
    getarrint0(a, n, in);
    getarrint0(b, m, in);
    lp = linearSievePrimes(10000005);
    vector<int> f1(10000005, 0), f2(10000005, 0);
    for (int i = 0; i <= n - 1; i++) {
      for (int j = a[i]; j != 1; j /= lp[j]) {
        f1[lp[j]]++;
      }
    }
    for (int i = 0; i <= m - 1; i++) {
      for (int j = b[i]; j != 1; j /= lp[j]) {
        f2[lp[j]]++;
      }
    }
    for (int i = 0; i <= 10000005 - 1; i++) {
      int mn = min(f1[i], f2[i]);
      f1[i] -= mn;
      f2[i] -= mn;
    }
    out << n << ' ' << m << '\n';
    for (int i = 0; i <= n - 1; i++) {
      int num = 1;
      for (int j = a[i]; j != 1; j /= lp[j]) {
        if (f1[lp[j]] != 0) {
          f1[lp[j]]--;
          num *= lp[j];
        }
      }
      out << num << ' ';
    }
    out << '\n';
    for (int i = 0; i <= m - 1; i++) {
      int num = 1;
      for (int j = b[i]; j != 1; j /= lp[j]) {
        if (f2[lp[j]] != 0) {
          f2[lp[j]]--;
          num *= lp[j];
        }
      }
      out << num << ' ';
    }
    out << '\n';
    return;
  }
};
void solve(std::istream& in, std::ostream& out) {
  out << std::setprecision(12);
  Solution solution;
  solution.solve(in, out);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  istream& in = cin;
  ostream& out = cout;
  solve(in, out);
  return 0;
}
