Crystals

A row contains $N$ crystals. The type of the $i$-th crystal from the left is $A_{i}$.

For each type $c$, removing crystals of type $c$ has an activation cost $X_{c}$.

You may perform the following operation any number of times:

• Choose a nonempty contiguous block of crystals that all have the same type $c$, and remove every crystal in the chosen block, paying a cost of $X_{c}$.
• The crystals to the left and right of the removed block close the gap while preserving their relative order.

Determine the minimum total cost required to remove all crystals.

The first line contains two integers $N$ and $M$.

The second line contains integers $A_1,A_2,\ldots,A_N$, separated by spaces.

The third line contains integers $X_1,X_2,\ldots,X_M$, separated by spaces.

• $1 \le N \le 400$
• $1 \le M \le N$
• $1 \le A_{i} \le M$
• Every type from $1$ to $M$ appears at least once.
• $1 \le X_{c} \le 10^{9}$

Print the minimum total cost required to remove all crystals.