#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ ll solve(){ ll res = 0; ll N; cin >> N; ll A; cin >> A; vector B(A); for(auto&in:B) cin >> in; ll C; cin >> C; vector D(C); for(auto&in:D) cin >> in; sort(B.begin(),B.end()); sort(D.begin(),D.end()); auto tB = B; auto tD = D; while(N--){ if(tB.empty()) tB = B; if(tD.empty()) tD = D; bool update = false; ll c = tD.front(); for(int i = 0; i < tB.size();i++){ if(tB[i]>c){ res++; update = true; tB.erase(tB.begin()+i); tD.erase(tD.begin()); break; } } if(update) continue; tB.erase(tB.begin()); tD.erase(tD.end()-1); } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }