<? echo $row['title']." - ".$MSG_PROBLEM."

Description

Problem Statement

We have an integer sequence

A

of length

N

and an integer sequence

B

of length

M

.
Takahashi will make a new sequence

^{'}

by removing some elements (possibly zero or all) from

A

and concatenating the remaining elements.
Similarly, he will make another new sequence

^{'}

by removing some elements (possibly zero or all) from

B

and concatenating the remaining elements.
Here, he will remove elements so that

|^{'} | = |^{'} |

. (

| s |

denotes the length of

s

for a sequence

s

.)
Let

x

be the total number of elements removed from

A

and

B

, and

y

be the number of integers

i

i such that

1 \leq i \leq |^{'} |

and

_{i} \neq_{i}

. Print the minimum possible value of

x + y

Constraints

$1 \leq N, M \leq 1000$
$1 \leq_{i},_{i} \leq^{9}$
All values in input are integers.

Input

Input is given from Standard Input in the following format:

 $N$  $M$

 $_{1}_{2}_{3} \dots_{N}$

 $_{1}_{2}_{3} \dots_{M}$

Output

Print the minimum possible value of

x + y

Sample Input Copy

4 3
1 2 1 3
1 3 1

Sample Output Copy

HINT

If we make

^{'}

by removing

_{4}

from

A

, and

^{'}

by removing nothing from

B

x

will be

1

.
Here, there is just one integer

i

such that

1 \leq i \leq |^{'} |

and

_{i} \neq_{i}

i = 2

y

will be

1

, and

x + y

will be

2

, which is the minimum possible value.

Source/Category

AtCoder 白银强算法动态规划编辑距离

2116: ABC185E Sequence Matching

Description

Problem Statement

Constraints

Input

Input

Output

Output

Sample Input Copy

Sample Output Copy

HINT

Source/Category