#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int inf = 1000000000;

#define MAX 100

int N, S, R, x;

int r[ MAX ];
int s[ MAX ];
int g[ MAX ];
int sol;

void check() {
     int c = 0;
     for( int i = 0; i < N; ++i )
          if( s[i] && !g[i] && !r[i] ) ++c;
     sol = min( sol, c );
}

void rec( int x ) 
{
     if( x == N ) { check(); return; }
     if( !r[x] ) { rec( x+1 ); return; }
     if( !s[x] && r[x] ) {
         if( x > 0 ) { ++g[x-1]; rec( x+1 ); --g[x-1]; }
         if( x < N-1 ) { ++g[x+1]; rec( x+1 ); --g[x+1]; }
     }
}

int main( void )
{
    scanf( "%d%d%d", &N, &S, &R );
    for( int i = 0; i < S; ++i ) {
         scanf( "%d", &x ); --x;
         s[x] = 1;
    }
    for( int i = 0; i < R; ++i ) {
         scanf( "%d", &x ); --x;
         r[x] = 1;
    }
    
    sol = inf;
    rec( 0 );
    
    printf( "%d\n", sol );
    scanf( "\n" );
    
    return 0;
}

/*
5 2 3
2 4
1 3 5

5 2 1
2 4
3

*/