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 $A'$ by removing some elements (possibly zero or all) from $A$ and concatenating the remaining elements. Similarly, he will make another new sequence $B'$ by removing some elements (possibly zero or all) from $B$ and concatenating the remaining elements. Here, he will remove elements so that $|A'| = |B'|$. ($|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$ such that $1 \le i \le |A'|$ and ${A'}_i \neq {B'}_i$. Print the minimium possible value of $x + y$.

Constraints

• $1 \le N, M \le 1000$
• $1 \le A_i, B_i \le 10^9$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M
A_1 \hspace{7pt} A_2 \hspace{7pt} A_3 \hspace{5pt} \dots \hspace{5pt} A_N
B_1 \hspace{7pt} B_2 \hspace{7pt} B_3 \hspace{5pt} \dots \hspace{5pt} B_M

Output

Print the minimum possible value of $x + y$.