Codeforces Round 365 (Div. 2)
B
Mishka and trip
Codeforces
1400
原题
← AC →
翻译中…

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 $*c*_{*i*}$.
  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 every $1 ≤ *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 $*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.

翻译中…

Note

翻译中…

This image describes first sample case:

翻译中…

image

翻译中…

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

翻译中…

This image describes second sample case:

翻译中…

image

翻译中…

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

翻译中…

样例

Input #1
4 1
2 3 1 2
3
Output #1
17
InputCopy OutputCopy
Input #2
5 2
3 5 2 2 4
1 4
Output #2
71
InputCopy OutputCopy
题目信息
题号
703B
时间限制
1 s
内存限制
256 MB
标签
模拟
数学

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