School Waltz#7380
The grand finale of the graduation ball will feature a performance of the school waltz. To prepare for this, we need to form as many traditional dance pairs as possible. The requirement for each pair is that the young man must not be shorter than his partner. The heights of all the boys are given in array A_1, \ldots, A_N, and the heights of all the girls are in array B_1, \ldots, B_M. Your task is to determine the maximum number of dance pairs that can be formed under these conditions.
The first line contains the integers and . The second line lists integers A_i (i = 1, \ldots, N), representing the heights of the boys. The third line lists integers B_j (j = 1, \ldots, M), representing the heights of the girls. All numbers are natural numbers and do not exceed .
Print the maximum number of pairs that can be formed.
Example 1