#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include using namespace std; #define MOD 1000000007 namespace math{ long long int __gcd(long long int a, long long int b){ if (a > b){ swap(a, b); } while (a){ swap(a, b); a %= b; } return b; } long long int lcm(long long int a, long long int b){ long long int g = __gcd(a, b); a /= g; return a*b; } long long int ppow(long long int i, long long int j){ long long int res = 1LL; while (j){ if (j & 1LL){ res *= i; res %= MOD; } i *= i; i %= MOD; j >>= 1LL; } return res; } namespace factorial{ vector lo; vector l2; void set_long(long long int b){ if (lo.size()){ } else{ lo.push_back(1); } for (long long int i = lo.size(); i <= b; i++){ lo.push_back(lo.back()); lo.back() *= i; if (lo.back() >= MOD){ lo.back() %= MOD; } } } void set_log(long long int b){ if (l2.size()){ } else{ l2.push_back(log(0.0)); } for (long long int i = l2.size(); i <= b; i++){ l2.push_back(l2.back()); l2.back() += log((double)(i)); } } long long int get_long(int b){ if (lo.size() <= b){ set_long(b); } return lo[b]; } double get_log(int b){ if (l2.size() <= b){ set_log(b); } return l2[b]; } } namespace combination{ long long int simpleC(long long int a, long long int b){ if (a < b){ return 0; } if (a - b < b){ b = a - b; } long long int u = 1LL; for (long long int j = a; j >= a - b + 1LL; j--){ u *= j; if (u >= MOD){ u %= MOD; } } long long int s = 1LL; for (long long int i = 1LL; i <= b; i++){ s *= i; if (s >= MOD){ s %= MOD; } } return (u*ppow(s, MOD - 2)) % MOD; } long long int C(long long int a, long long int b){ if (a < b){ return 0; } long long int u = math::factorial::get_long(a); long long int s = math::factorial::get_long(b)*math::factorial::get_long(a - b); u %= MOD; s %= MOD; return (u*ppow(s, MOD - 2)) % MOD; } double logC(int a, int b){ double u = math::factorial::get_log(a); double s = math::factorial::get_log(b) + math::factorial::get_log(a - b); return u - s; } long long int H(long long int a, long long int b){ return math::combination::C(a + b - 1LL, b); } long long int simpleH(long long int a, long long int b){ return math::combination::simpleC(a + b - 1LL, b); } } namespace prime{ vector prime; vector use; //smallest divisor void init(int b){ use.assign(b + 1, 0); prime.clear(); prime.push_back(2); use[2] = 2; for (int i = 3; i < use.size(); i += 2){ if (use[i] == 0LL){ prime.push_back(i); use[i] = i; for (int j = i * 2; j < use.size(); j += i){ use[j] = i; } } } } vector factorizetion(long long int num){ vector r; r.clear(); for (int i = 0; i 1LL){ r.push_back(num); } return r; } int size_of_factorization(long long int num){ int cnt = 0; for (int i = 0; i 1LL){ cnt++; } return cnt; } long long int number_of_div(long long int num){ long long int way = 1LL; long long int cnt = 0; for (int i = 0; i < prime.size() && prime[i] * prime[i] <= num; i++){ cnt = 0; while (num%prime[i] == 0){ cnt++; num /= prime[i]; } way *= (cnt + 1LL); } if (num > 1LL){ way *= 2LL; } return way; } } } using namespace math; int n; int a; int c; vector v; vector vv; int main(){ scanf("%d", &n); scanf("%d", &a); for (int i = 0; i < a; i++){ int k; scanf("%d", &k); v.push_back(k); } scanf("%d", &c); for (int j = 0; j < c; j++){ int k; scanf("%d", &k); vv.push_back(k); } sort(v.begin(), v.end()); sort(vv.begin(), vv.end()); vector A = v; vector B = vv; int countt = 0; int v_siz = 0; while (v.size()> n%A.size()){ v.erase(v.begin(), v.begin() + 1); } while (vv.size()> n%B.size()){ vv.pop_back(); } while (n--){ if (v_siz==0||v.size() == 0){ v = A; v_siz = A.size(); } if (vv.size() == 0){ vv = B; } int nex = vv[0]; int ind = upper_bound(v.begin(), v.end(), nex) - v.begin(); if (ind == v.size()){ ind = 0; } if (v[ind] > nex){ countt++; } v.erase(ind + v.begin(), ind + 1 + v.begin()); v_siz--; vv.erase(0 + vv.begin(), 1 + vv.begin()); } printf("%d\n", countt); return 0; }