B"A team of three programmers is going to play a contest. The contest consists of n problems, numbered from 1 to n . Each problem is printed on a separate sheet of paper. The participants have decided to divide the problem statements into three parts: the first programmer took some prefix of the statements (some number of first paper sheets), the third contestant took some suffix of the statements (some number of last paper sheets), and the second contestant took all remaining problems. But something went wrong -- the statements were printed in the wrong order, so the contestants have received the problems in some random order. The first contestant has received problems a_{1, 1}, a_{1, 2}, ... , a_{1, k_1} . The second one has received problems a_{2, 1}, a_{2, 2}, ... , a_{2, k_2} . The third one has received all remaining problems ( a_{3, 1}, a_{3, 2}, ... , a_{3, k_3} ). The contestants don't want to play the contest before they redistribute the statements. They want to redistribute them so that the first contestant receives some prefix of the problemset, the third contestant receives some suffix of the problemset, and the second contestant receives all the remaining problems. During one move, some contestant may give one of their problems to other contestant. What is the minimum number of moves required to redistribute the problems? It is possible that after redistribution some participant (or even two of them) will not have any problems. The first line contains three integers k_1, k_2 and k_3 ( 1 <= k_1, k_2, k_3 <= 2 cdot 10^5, k_1 + k_2 + k_3 <= 2 cdot 10^5 ) -- the number of problems initially taken by the first, the second and the third participant, respectively. The second line contains k_1 integers a_{1, 1}, a_{1, 2}, ... , a_{1, k_1} -- the problems initially taken by the first participant. The third line contains k_2 integers a_{2, 1}, a_{2, 2}, ... , a_{2, k_2} xe2"...