As you know, a kayaking competition is going on as we speak.
Unfortunately strong winds have damaged a few kayaks, and the
race starts in 5 minutes!. Fortunately, some teams have brought
reserve kayaks. Since kayaks are bulky and hard to carry, teams
are willing to lend kayaks to opposing teams if and only if
they are starting immediately next to them. For example, team
with the starting number 4 will lend its reserve kayak only to
teams 3 and 5. Of course if some team did bring a reserve and
its kayak was damaged, they will use it themselves and not lend
it to anyone.
You as the organizer now need to know, what is the minimal
number of teams that cannot start the race, not even in
borrowed kayaks.
Input
The first line of input contains three integers $N$, $(2
\le N \le 10)$, total number of teams, $S$, $(2
\le S \le N)$, number of teams with damaged kayaks and
$R$, $(1 \le R \le N)$, number of teams
with reserve kayaks.
The second line contains exactly $S$ numbers, the starting numbers of
teams with damaged kayaks. The second line will not contain
duplicates.
The third line contains exactly $R$ numbers, the starting numbers of
teams with reserve kayaks. The third line will not contain
duplicates.
Output
The first and only line of output should contain the
smallest number of teams that cannot start the competition.
Sample Input 1 
Sample Output 1 
5 2 3
2 4
1 3 5

0

Sample Input 2 
Sample Output 2 
5 2 1
2 4
3

1
