codeforces 703B. Mishka and trip

B. Mishka and trip

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Mishka is a great traveller and she visited many countries. After thinking about where to travel this time, she chose XXX — beautiful, but little-known northern country.

Here are some interesting facts about XXX:

1. XXX consists of n cities, k of whose (just imagine!) are capital cities.
2. All of cities in the country are beautiful, but each is beautiful in its own way. Beauty value of i-th city equals to ci.
3. All the cities are consecutively connected by the roads, including 1-st and n-th city, forming a cyclic route 1 — 2 — ... — n — 1. Formally, for every 1 ≤ i < n there is a road between i-th and i + 1-th city, and another one between 1-st and n-th city.
4. Each capital city is connected with each other city directly by the roads. Formally, if city x is a capital city, then for every1 ≤ i ≤ n,  i ≠ x, there is a road between cities x and i.
5. There is at most one road between any two cities.
6. Price of passing a road directly depends on beauty values of cities it connects. Thus if there is a road between cities i and j, price of passing it equals ci·cj.

Mishka started to gather her things for a trip, but didn't still decide which route to follow and thus she asked you to help her determine summary price of passing each of the roads in XXX. Formally, for every pair of cities a and b (a < b), such that there is a road betweena and b you are to find sum of products ca·cb. Will you help her?

Input

The first line of the input contains two integers n and k (3 ≤ n ≤ 100 000, 1 ≤ k ≤ n) — the number of cities in XXX and the number of capital cities among them.

The second line of the input contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 10 000) — beauty values of the cities.

The third line of the input contains k distinct integers id1, id2, ..., idk (1 ≤ idi ≤ n) — indices of capital cities. Indices are given in ascending order.

Output

Print the only integer — summary price of passing each of the roads in XXX.

Examples

input

4 1
2 3 1 2
3

output

17

input

5 2
3 5 2 2 4
1 4

output

71

Note

This image describes first sample case:

It is easy to see that summary price is equal to 17.

This image describes second sample case:

It is easy to see that summary price is equal to 71.

题目：有n个城市，每个城市有一个价值，围成环，两个城市之间的路程是这两个城市价值的积，有一些特殊城市 它们和其他的城市之间均有边，问所有路径的和

思路：首先有个路径是环;

然后特殊的城市和自身+左右相邻的城市路径不计其数;

标记访问过的特殊城市，以免访问下个城市算重;

如果访问的城市和上一个城市相邻，不能再次减它的价值

(思维不强，组织能力不够)

代码：

#include<cstdio>
#include<cstring>
#define M 100010
bool vis[M];//标记访问过的特殊城市 
__int64 a[M]; 
int main()
{
	int n,m,x;
	int i;
	__int64 sum=0,ans=0;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
	{
		scanf("%I64d",&a[i]);
		if(i>1)	ans+=a[i]*a[i-1];
		sum+=a[i];
	}
	ans+=a[n]*a[1];	//围成环的总路程 
	int res=0;
	while(m--)
	{
		scanf("%d",&x);
		vis[x]=1;
		int l,r;//成环的左右相邻点 
		if(x==1)
			l=n;
		else
			l=x-1;
		if(x==n)
			r=1;
		else
			r=x+1;
		ans+=(sum-a[x]-a[l]-a[r])*a[x];//	减去自身和左右相邻点的乘积 
		int s=res;	//标记过的城市相连的路径，防止加重 
		if(vis[l])	//标记过且相邻，在 上面已经减过了，防止减重 
			s-=a[l];
		if(vis[r])
			s-=a[r];
		ans-=s*a[x];
		res+=a[x];
	}
	printf("%I64d\n",ans);
	return 0;
}