Game Shopping

Maxim wants to buy some games at the local game shop. There are $ n $ games in the shop, the $ i $ -th game costs $ c_i $ . Maxim has a wallet which can be represented as an array of integers. His wallet contains $ m $ bills, the $ j $ -th bill has value $ a_j $ . Games in the shop are ordered from left to right, Maxim tries to buy every game in that order. When Maxim stands at the position $ i $ in the shop, he takes the first bill from his wallet (if his wallet is empty then he proceeds to the next position immediately) and tries to buy the $ i $ -th game using this bill. After Maxim tried to buy the $ n $ -th game, he leaves the shop. Maxim buys the $ i $ -th game if and only if the value of the first bill (which he takes) from his wallet is greater or equal to the cost of the $ i $ -th game. If he successfully buys the $ i $ -th game, the first bill from his wallet disappears and the next bill becomes first. Otherwise Maxim leaves the first bill in his wallet (this bill still remains the first one) and proceeds to the next game. For example, for array $ c = [2, 4, 5, 2, 4] $ and array $ a = [5, 3, 4, 6] $ the following process takes place: Maxim buys the first game using the first bill (its value is $ 5 $ ), the bill disappears, after that the second bill (with value $ 3 $ ) becomes the first one in Maxim's wallet, then Maxim doesn't buy the second game because $ c_2 > a_2 $ , the same with the third game, then he buys the fourth game using the bill of value $ a_2 $ (the third bill becomes the first one in Maxim's wallet) and buys the fifth game using the bill of value $ a_3 $ . Your task is to get the number of games Maxim will buy.

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.

5 4
2 4 5 2 4
5 3 4 6

3

5 2
20 40 50 20 40
19 20

0

6 4
4 8 15 16 23 42
1000 1000 1000 1000

4

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.