A11923 | Game Shopping

The first line of the input contains two integers $n$ and $m$ ( $1 \le n, m \le 1000$ ) — the number of games and the number of bills in Maxim's wallet.

The second line of the input contains $n$ integers $c_1, c_2, \dots, c_n$ ( $1 \le c_i \le 1000$ ), where $c_i$ is the cost of the $i$ -th game.

The third line of the input contains $m$ integers $a_1, a_2, \dots, a_m$ ( $1 \le a_j \le 1000$ ), where $a_j$ is the value of the $j$ -th bill from the Maxim's wallet.

Print a single integer — the number of games Maxim will buy.

The first example is described in the problem statement.

In the second example Maxim cannot buy any game because the value of the first bill in his wallet is smaller than the cost of any game in the shop.

In the third example the values of the bills in Maxim's wallet are large enough to buy any game he encounter until he runs out of bills in his wallet.