#include <bits/stdc++.h>
using namespace std;
int inf_int = 2e9;
long long inf_ll = 2e18;
const double pi = 3.1415926535898;
template <typename T>
void prin(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i];
    if (i < a.size() - 1)
      cout << " ";
    else
      cout << "\n";
  }
}
template <typename T>
void prin(set<T>& a) {
  for (auto it = a.begin(); it != a.end(); it++) {
    cout << *it << " ";
  }
}
template <typename T>
void prin_new_line(vector<T>& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i] << "\n";
  }
}
template <typename T, typename T1>
void prin_new_line(vector<pair<T, T1> >& a) {
  for (int i = 0; i < a.size(); i++) {
    cout << a[i].first << " " << a[i].second << "\n";
  }
}
int sum_vec(vector<int>& a) {
  int s = 0;
  for (int i = 0; i < a.size(); i++) {
    s += a[i];
  }
  return s;
}
template <typename T>
T max(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = max(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(vector<T>& a) {
  T ans = a[0];
  for (int i = 1; i < a.size(); i++) {
    ans = min(ans, a[i]);
  }
  return ans;
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
double s_triangle(double x1, double y1, double x2, double y2, double x3,
                  double y3) {
  return abs(((x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1)) / 2);
}
bool overflow(long long a, long long b) {
  if (a * b / b != a) return true;
  return false;
}
bool debug = 1;
const int maxn = 1e7 + 20;
long long mod = 1e9 + 7;
int cnt_a[maxn], cnt_b[maxn];
void solve() {
  vector<int> pr;
  for (int i = 2; i <= 1e4; i++) {
    bool k = 1;
    for (int e = 2; e * e <= i; e++) {
      if (i % e == 0) {
        k = 0;
        break;
      }
    }
    if (k) {
      pr.push_back(i);
    }
  }
  int n, m;
  cin >> n >> m;
  int a[n], b[m];
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    a[i] = x;
    int in = 0;
    while (pr[in] * pr[in] <= x) {
      while (x % pr[in] == 0) {
        cnt_a[pr[in]]++;
        x = x / pr[in];
      }
      in++;
    }
    if (x > 1) {
      cnt_a[x]++;
    }
  }
  for (int i = 0; i < m; i++) {
    int x;
    cin >> x;
    b[i] = x;
    int in = 0;
    while (pr[in] * pr[in] <= x) {
      while (x % pr[in] == 0) {
        cnt_b[pr[in]]++;
        x = x / pr[in];
      }
      in++;
    }
    if (x > 1) {
      cnt_b[x]++;
    }
  }
  for (int i = 0; i < maxn; i++) {
    if (cnt_a[i] >= cnt_b[i]) {
      cnt_a[i] -= cnt_b[i];
      cnt_b[i] = 0;
    } else {
      cnt_b[i] -= cnt_a[i];
      cnt_a[i] = 0;
    }
  }
  vector<long long> ans1, ans2;
  for (int i = 0; i < n; i++) {
    int x = a[i];
    int in = 0;
    long long ans = 1;
    while (pr[in] * pr[in] <= x) {
      while (x % pr[in] == 0) {
        if (cnt_a[pr[in]]) {
          ans = ans * pr[in];
          cnt_a[pr[in]]--;
        }
        x = x / pr[in];
      }
      in++;
    }
    if (x > 1) {
      if (cnt_a[x]) {
        ans = ans * x;
        cnt_a[x]--;
      }
    }
    ans1.push_back(ans);
  }
  for (int i = 0; i < m; i++) {
    int x = b[i];
    int in = 0;
    long long ans = 1;
    while (pr[in] * pr[in] <= x) {
      while (x % pr[in] == 0) {
        if (cnt_b[pr[in]]) {
          ans = ans * pr[in];
          cnt_b[pr[in]]--;
        }
        x = x / pr[in];
      }
      in++;
    }
    if (x > 1) {
      if (cnt_b[x]) {
        ans = ans * x;
        cnt_b[x]--;
      }
    }
    ans2.push_back(ans);
  }
  cout << ans1.size() << " " << ans2.size() << "\n";
  prin(ans1);
  prin(ans2);
}
int main() {
  if (!debug) {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
  int t = 1;
  while (t--) solve();
  return 0;
}
