Description

Batman is caught by the Joker, but Joker does not want to kill Batman directly, he wants to play a game with Batman. Now Batman has a non-decreasing array $A$ of length $n$. Joker has a non-decreasing array $B$ of length $m$. Joker asks Batman to choose a number $a$ randomly from array $A$. Meanwhile he chooses a number $b$ randomly from array $B$. If $a>b$ , Joker will let Batman go. Batman now wants to know how many scenarios he could survive.

Input

The first line contains two integers $n$ and $m$ ($1 \leq n, m \leq 10^6$).

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($0 \leq a_1 \leq ... \leq a_n \leq 10^6$).

The third line contains $m$ integers $b_1, b_2,\ldots ,b_m$ ($0 \leq b_1 \leq ... \leq b_m \leq 10^6$).

Output

Print one integer, indicating the number of the scenarios he could survive.

Samples

5 5
2 3 4 5 6
1 2 3 4 5

15

Note

The answer may exceed the int range.

Resources

电子科技大学第十三届 ACM 趣味程序设计竞赛