#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

int main(){
    int n, m;
    cin >> n >> m;
    set<int> a, b;
    rep(i, n) {
        int x;
        cin >> x;
        a.insert(x);
    }
    rep(i, m) {
        int x;
        cin >> x;
        b.insert(x);
    }
    set<int> x, y;
    for(auto&& i : a) x.insert(i);
    for(auto&& i : b) x.insert(i);
    for(auto&& i : a) if(b.count(i)) y.insert(i);
    cout << y.size() << " " << x.size() << endl;
    for(auto&& i : y) cout << i << endl;
    for(auto&& i : x) cout << i << endl;
    return 0;
}
