#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair;using vb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; template T read() {T t; cin >> t; return t;} void Main() { int n = read(); int a = read(); multiset A, B; vi aa, bb; rep(i, a) { int c = read(); A.insert(c); aa.push_back(c); } int b = read(); rep(i, b) { int c = read(); B.insert(c); bb.push_back(c); } int ans = 0; while (n--) { if (*A.rbegin() > *B.begin()) { auto a_ub = A.upper_bound(*B.begin()); auto b_lb = B.lower_bound(*a_ub); b_lb--; ans++; A.erase(a_ub); B.erase(b_lb); } else { A.erase(*A.begin()); B.erase(*B.rbegin()); } if (sz(A) == 0) { A.insert(all(aa)); } if (sz(B) == 0) { B.insert(all(bb)); } } cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }