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.

×
C. New Year Book Reading

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputNew Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has *n* books numbered by integers from 1 to *n*. The weight of the *i*-th (1 ≤ *i* ≤ *n*) book is *w*_{i}.

As Jaehyun's house is not large enough to have a bookshelf, he keeps the *n* books by stacking them vertically. When he wants to read a certain book *x*, he follows the steps described below.

- He lifts all the books above book
*x*. - He pushes book
*x*out of the stack. - He puts down the lifted books without changing their order.
- After reading book
*x*, he puts book*x*on the top of the stack.

He decided to read books for *m* days. In the *j*-th (1 ≤ *j* ≤ *m*) day, he will read the book that is numbered with integer *b*_{j} (1 ≤ *b*_{j} ≤ *n*). To read the book, he has to use the process described in the paragraph above. It is possible that he decides to re-read the same book several times.

After making this plan, he realized that the total weight of books he should lift during *m* days would be too heavy. So, he decided to change the order of the stacked books before the New Year comes, and minimize the total weight. You may assume that books can be stacked in any possible order. Note that book that he is going to read on certain step isn't considered as lifted on that step. Can you help him?

Input

The first line contains two space-separated integers *n* (2 ≤ *n* ≤ 500) and *m* (1 ≤ *m* ≤ 1000) — the number of books, and the number of days for which Jaehyun would read books.

The second line contains *n* space-separated integers *w*_{1}, *w*_{2}, ..., *w*_{n} (1 ≤ *w*_{i} ≤ 100) — the weight of each book.

The third line contains *m* space separated integers *b*_{1}, *b*_{2}, ..., *b*_{m} (1 ≤ *b*_{j} ≤ *n*) — the order of books that he would read. Note that he can read the same book more than once.

Output

Print the minimum total weight of books he should lift, which can be achieved by rearranging the order of stacked books.

Examples

Input

3 5

1 2 3

1 3 2 3 1

Output

12

Note

Here's a picture depicting the example. Each vertical column presents the stacked books.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/13/2021 23:04:43 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|