Good Bye 2014
C
New Year Book Reading
Codeforces
1600
原题
← BD →
翻译中…

New 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.

翻译中…
  1. He lifts all the books above book $*x*$.
  2. He pushes book $*x*$ out of the stack.
  3. He puts down the lifted books without changing their order.
  4. After reading book $*x*$, he puts book $*x*$ on the top of the stack.
翻译中…

image

翻译中…

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.

翻译中…

Note

翻译中…

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

翻译中…

image

翻译中…

样例

Input #1
3 5
1 2 3
1 3 2 3 1
Output #1
12
InputCopy OutputCopy
题目信息
题号
500C
所属比赛
时间限制
2 s
内存限制
256 MB
标签
构造
贪心
模拟
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。