Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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

B. Mishka and trip

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLittle 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:

- XXX consists of
*n*cities,*k*of whose (just imagine!) are capital cities. - All of cities in the country are beautiful, but each is beautiful in its own way. Beauty value of
*i*-th city equals to*c*_{i}. - 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. - Each capital city is connected with each other city directly by the roads. Formally, if city
*x*is a capital city, then for every 1 ≤*i*≤*n*,*i*≠*x*, there is a road between cities*x*and*i*. - There is at most one road between any two cities.
- 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*c*_{i}·*c*_{j}.

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 between *a* and *b* you are to find sum of products *c*_{a}·*c*_{b}. 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 *c*_{1}, *c*_{2}, ..., *c*_{n} (1 ≤ *c*_{i} ≤ 10 000) — beauty values of the cities.

The third line of the input contains *k* distinct integers *id*_{1}, *id*_{2}, ..., *id*_{k} (1 ≤ *id*_{i} ≤ *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.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/13/2017 14:03:47 (c6).

Desktop version, switch to mobile version.

User lists

Name |
---|