Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. George and Cards

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputGeorge is a cat, so he loves playing very much.

Vitaly put *n* cards in a row in front of George. Each card has one integer written on it. All cards had distinct numbers written on them. Let's number the cards from the left to the right with integers from 1 to *n*. Then the *i*-th card from the left contains number *p*_{i} (1 ≤ *p*_{i} ≤ *n*).

Vitaly wants the row to have exactly *k* cards left. He also wants the *i*-th card from left to have number *b*_{i} written on it. Vitaly gave a task to George, to get the required sequence of cards using the remove operation *n* - *k* times.

In one remove operation George can choose *w* (1 ≤ *w*; *w* is not greater than the current number of cards in the row) contiguous cards (contiguous subsegment of cards). Let's denote the numbers written on these card as *x*_{1}, *x*_{2}, ..., *x*_{w} (from the left to the right). After that, George can remove the card *x*_{i}, such that *x*_{i} ≤ *x*_{j} for each *j* (1 ≤ *j* ≤ *w*). After the described operation George gets *w* pieces of sausage.

George wondered: what maximum number of pieces of sausage will he get in total if he reaches his goal and acts optimally well? Help George, find an answer to his question!

Input

The first line contains integers *n* and *k* (1 ≤ *k* ≤ *n* ≤ 10^{6}) — the initial and the final number of cards.

The second line contains *n* distinct space-separated integers *p*_{1}, *p*_{2}, ..., *p*_{n} (1 ≤ *p*_{i} ≤ *n*) — the initial row of cards.

The third line contains *k* space-separated integers *b*_{1}, *b*_{2}, ..., *b*_{k} — the row of cards that you need to get. It is guaranteed that it's possible to obtain the given row by using the remove operation for *n* - *k* times.

Output

Print a single integer — the maximum number of pieces of sausage that George can get if he acts optimally well.

Examples

Input

3 2

2 1 3

1 3

Output

1

Input

10 5

1 2 3 4 5 6 7 8 9 10

2 4 6 8 10

Output

30

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2022 02:44:24 (k2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|