#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi& a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}

const int MX = 100005, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

int n;
vi pa, pb, a, b;

int main(){
  n = in();
  int m = in();
  rep(i,m) pa.pb(in());
  m = in();
  rep(i,m) pb.pb(in());
  int ans = 0;
  a = pa; b = pb;
  rep(i,n) {
    vector<P> w, l;
    sort(rng(a));
    sort(rng(b));
    rep(j,sz(a))rep(k,sz(b)) {
      if (a[j] > b[k]) w.pb(P(j,k));
      else l.pb(P(j,k));
    }
    P p;
    if (sz(w)) {
      ans++;
      p = w.back();
      if (sz(a) > sz(b)) {
        for (P x : w) {
          if (p.se > x.se || (p.se==x.se&&p.fi>x.fi)) p = x;
        }
      } else {
        for (P x : w) {
          if (p.fi<x.fi || (p.fi==x.fi&&p.se<x.se)) p = x;
        }
      }
    } else {
      p = l.back();
      for (P x : l) {
        if (p.fi>x.fi || (p.fi==x.fi&&p.se<x.se)) p = x;
      }
    }
    a.erase(a.begin()+p.fi);
    b.erase(b.begin()+p.se);
    if (!sz(a)) a = pa;
    if (!sz(b)) b = pb;
  }
  cout << ans << endl;
  return 0;
}