990_E. Post Lamps
Adilbek's house is located on a street which can be represented as the OX axis. This street is really dark, so Adilbek wants to install some post lamps to illuminate it. Street has n positions to install lamps, they correspond to the integer numbers from 0 to n - 1 on the OX axis. However, some positions are blocked and no post lamp can be placed there.

There are post lamps of different types which differ only by their power. When placed in position x, post lamp of power l illuminates the segment [x; x + l]. The power of each post lamp is always a positive integer number.

The post lamp shop provides an infinite amount of lamps of each type from power 1 to power k. Though each customer is only allowed to order post lamps of exactly one type. Post lamps of power l cost a_l each.

What is the minimal total cost of the post lamps of exactly one type Adilbek can buy to illuminate the entire segment [0; n] of the street? If some lamps illuminate any other segment of the street, Adilbek does not care, so, for example, he may place a lamp of power 3 in position n - 1 (even though its illumination zone doesn't completely belong to segment [0; n]).

Input

The first line contains three integer numbers n, m and k (1 ≤ k ≤ n ≤ 10^6, 0 ≤ m ≤ n) — the length of the segment of the street Adilbek wants to illuminate, the number of the blocked positions and the maximum power of the post lamp available.

The second line contains m integer numbers s_1, s_2, ..., s_m (0 ≤ s_1 < s_2 < ... s_m < n) — the blocked positions.

The third line contains k integer numbers a_1, a_2, ..., a_k (1 ≤ a_i ≤ 10^6) — the costs of the post lamps.

Output

Print the minimal total cost of the post lamps of exactly one type Adilbek can buy to illuminate the entire segment [0; n] of the street.

If illumintaing the entire segment [0; n] is impossible, print -1.

Examples

Input

6 2 3
1 3
1 2 3


Output

6


Input

4 3 4
1 2 3
1 10 100 1000


Output

1000


Input

5 1 5
0
3 3 3 3 3


Output

-1


Input

7 4 3
2 4 5 6
3 14 15


Output

-1
```python
import sys
from array import array

n, m, k = map(int, input().split())
block = list(map(int, input().split()))
a = [0] + list(map(int, input().split()))

if block and block[0] == 0:
    print(-1)
    exit()

prev = array('i', list(range(n)))
for x in block:
    prev[x] = -1

for i in range(1, n):
    if prev[i] == -1:
        prev[i] = prev[i-1]

inf = ans = 10**18

for i in range(1, k+1):
    s = 0
    cost = 0
    while True:
        cost += a[i]
        t = s+i

        if t >= n:
            break
        if prev[t] == s:
            cost = inf
            break
        s = prev[t]

    ans = min(ans, cost)

print(ans if ans < inf else -1)

```