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 Specification
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~ 
~(2 \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 Specification
The first and only line of output should contain the smallest number of
teams that cannot start the competition.
Sample Input 1
5 2 3
2 4
1 3 5
Sample Output 1
0
Sample Input 2
5 2 1
2 4
3
Sample Output 2
1
Comments
Could someone give a hint for test case 13 please (:)
(I ave already solved it, ty), and if you fail on this test case, try :
3 2 2
2 3
1 2
it should give an output of 1
The official data to this problem were weak, and two test cases have been added as a result.