CodeForces 500C

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.

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₁, w₂, ..., w_n (1 ≤ w_i ≤ 100) — the weight of each book.

The third line contains m space separated integers b₁, b₂, ..., 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.

Sample Input

Input

3 5
1 2 3
1 3 2 3 1

Output

12

Hint

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

题意：给你n表示有n本书之后m表示要看m天。

之后一行n个数表示书的重量，再一行m个数表示每天读的是哪本书。

要你求出他所举起的书的最小重量的总和。

每次他看书的时候，在这本书上面的所有书的重量的总和就是他今天所要举起的书的重量。

思路：贪心吧，就是得按照看书的顺序构造，不然你怎么建都还得走回这个顺序。

建立一个新的数组，然后每天看的时候，先从这个数组里面找所要找的书，那么上面的自然就是要举起来的。如果没找到那么你就需要加一本在后面咯。

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int MAXN=500+10;
int w[MAXN];
int b[MAXN];
int main()
{
    int n,m;
    int i,j,k;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)scanf("%d",&w[i]);
    int cnt=0,ans=0;
    int x;
    for(i=1;i<=m;++i)
    {
        scanf("%d",&x);
        bool flag=0;
        for(j=1;j<=cnt;++j)
        {
            if(b[j]==x)
            {
                flag=1;
                for( k=j;k>=1;--k)b[k]=b[k-1];
                b[1]=x;
                break;
            }
            ans+=w[b[j]];
        }
        if(!flag)
        {
            cnt++;
            for( k=cnt;k>1;--k)b[k]=b[k-1];
            b[1]=x;
        }
    }
    printf("%d\n",ans);
    return 0;
}