Codeforces 500C：New Year Book Reading（思维+贪心？）

C. New Year Book Reading

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

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 bj (1 ≤ bj ≤ 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 w1, w2, ..., wn (1 ≤ wi ≤ 100) — the weight of each book.

The third line contains m space separated integers b1, b2, ..., bm (1 ≤ bj ≤ 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.

题意：有n天，一共有m本书，每一本书有各自的重量，每一天要看一本书(n可以>m，就是可以多天看同一本)，放书的地方像一个栈，假如要取第二本书的话，必须将第一本书拿出来，最后将当天看完的书放在顶端，问如何摆放使得举起的重量最小。（注意题中给的例子1 3 2 3 1是书的编号）

思路：因为每次看完的书都必须放在顶端，每一次取书都必须承受之前看过的书的质量，因此应该按照书第一次出现的顺序来摆放，假设看书的顺序是a，b，书的摆放位置是b，a就需要额外承受多一次b的质量。

#include <cstdio>
#include <cstring>
int w[510];
int day[1010];
int xin[510];
int flag[510]; 
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		memset(flag,0,sizeof(flag));
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&w[i]);//i从1开始，w[i]表示编号为i的书的重量 
		}
		int geshu=0;
		for(int i=0;i<m;i++)//新生成一个需要的序列 
		{
			scanf("%d",&day[i]);//day[i]表示第i天读的书的编号 
			if(flag[day[i]]==0)
			{
				xin[geshu]=day[i];
				geshu++;
				flag[day[i]]=1;
			}
		}
		int ans=0;
		for(int i=0;i<m;i++)
		{
			int pos=0;
			while(xin[pos]!=day[i])//把要拿的那本书上面的重量都加上 
			{
				ans=ans+w[xin[pos]];
				pos++;
			}
			for(int j=pos;j>0;j--)//把上面的书都下移一位 
			{
				xin[j]=xin[j-1];
			}
			xin[0]=day[i];//让最上面的书为今天读的书 
		}
		printf("%d\n",ans);
	}
	return 0;
}