School Waltz
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 .. N], and the heights of all the girls are in array B [1 .. M]. Your task is to determine the maximum number of dance pairs that can be formed under these conditions.
Input
The first line contains the integers N and M. The second line lists N integers A[i] (i = 1 .. N), representing the heights of the boys. The third line lists M integers B[j] (j = 1 .. M), representing the heights of the girls. All numbers are natural numbers and do not exceed 1000.
Output
Print the maximum number of pairs that can be formed.