Welcome to ZOJ Contests Information Problems Runs Statistics Ranklist Clarification 69 - ZOJ Monthly, August 2008 - 1006
Puzzle

Time Limit: 2 Seconds      Memory Limit: 65536 KB

For sequences of integers a and b, if you can make the two sequences the same by deleting some elements in a and b, we call the remaining sequence "the common sub sequence". And we call the longest one the LCS.

Now you are given two sequences of integers a and b. You can arrange elements in a and b in any order. You are to calculate the max length of the LCS of each arrangement of a and b.

Input

Input will consist of multiple test cases. The first line of each case is two integers N(0 < N < 10000), M(0 < M < 10000) indicating the length of a and b. The second line is N 32-bit signed integers in a. The third line is M 32-bit signed integers in b.

Output

Each case one line. The max length of the LCS of each arrangement of a and b.

Sample Input

```5 4
1 2 3 2 1
1 4 2 1```

Sample Output

`3`

Author: ZHUANG, Junyuan

Submit    Status