B"A contest contains n problems and the difficulty of the i -th problem is expected to be at most b_i . There are already n problem proposals and the difficulty of the i -th problem is a_i . Initially, both a_1, a_2, ldots, a_n and b_1, b_2, ldots, b_n are sorted in non-decreasing order. Some of the problems may be more difficult than expected, so the writers must propose more problems. When a new problem with difficulty w is proposed, the most difficult problem will be deleted from the contest, and the problems will be sorted in a way that the difficulties are non-decreasing. In other words, in each operation, you choose an integer w , insert it into the array a , sort array a in non-decreasing order, and remove the last element from it. Find the minimum number of new problems to make a_i <= b_i for all i . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 100 ). The description of the test cases follows. The first line of each test case contains only one positive integer n ( 1 <= q n <= q 100 ), representing the number of problems. The second line of each test case contains an array a of length n ( 1 <= a_1 <= a_2 <= cdots <= a_n <= 10^9 ). The third line of each test case contains an array b of length n ( 1 <= b_1 <= b_2 <= cdots <= b_n <= 10^9 ). For each test case, print an integer as your answer in a new line. In the first test case: It can be proved that it's impossible to reach the goal by proposing fewer new problems. In the second test case: It can be proved that it's impossible to reach the goal by proposing fewer new problems. "...