1380_D. Berserk And Fireball_6353
There are n warriors in a row. The power of the i-th warrior is a_i. All powers are pairwise distinct.

You have two types of spells which you may cast: 

  1. Fireball: you spend x mana and destroy exactly k consecutive warriors; 
  2. Berserk: you spend y mana, choose two consecutive warriors, and the warrior with greater power destroys the warrior with smaller power. 



For example, let the powers of warriors be [2, 3, 7, 8, 11, 5, 4], and k = 3. If you cast Berserk on warriors with powers 8 and 11, the resulting sequence of powers becomes [2, 3, 7, 11, 5, 4]. Then, for example, if you cast Fireball on consecutive warriors with powers [7, 11, 5], the resulting sequence of powers becomes [2, 3, 4].

You want to turn the current sequence of warriors powers a_1, a_2, ..., a_n into b_1, b_2, ..., b_m. Calculate the minimum amount of mana you need to spend on it.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 2 ⋅ 10^5) — the length of sequence a and the length of sequence b respectively.

The second line contains three integers x, k, y (1 ≤ x, y, ≤ 10^9; 1 ≤ k ≤ n) — the cost of fireball, the range of fireball and the cost of berserk respectively.

The third line contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ n). It is guaranteed that all integers a_i are pairwise distinct.

The fourth line contains m integers b_1, b_2, ..., b_m (1 ≤ b_i ≤ n). It is guaranteed that all integers b_i are pairwise distinct.

Output

Print the minimum amount of mana for turning the sequnce a_1, a_2, ..., a_n into b_1, b_2, ..., b_m, or -1 if it is impossible.

Examples

Input


5 2
5 2 3
3 1 4 5 2
3 5


Output


8


Input


4 4
5 1 4
4 3 1 2
2 4 3 1


Output


-1


Input


4 4
2 1 11
1 3 2 4
1 3 2 4


Output


0
import sys
if sys.subversion[0] == "PyPy":
    import io, atexit
    sys.stdout = io.BytesIO()
    atexit.register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
    
    sys.stdin = io.BytesIO(sys.stdin.read())
    input = lambda: sys.stdin.readline().rstrip()

RS = raw_input
RI = lambda x=int: map(x,RS().split())
RN = lambda x=int: x(RS())
''' ...................................................................... '''

def solve(arr,lo,hi,x,k,y):
    # Delete index in interval := (lo,hi)
    n = hi-lo-1
    if n<=0: return 0
    maxi = -1
    for i in xrange(lo+1,hi):
        if arr[i]>maxi: maxi = arr[i]

    limit = max(arr[lo],arr[hi])

    if n<k:
        return y*n if maxi<limit else -1

    rem = n%k
    cost = rem*y
    n -= rem

    if k*y < x:
        if maxi<limit:
            cost += n*y
        else:
            cost += x + (n-k)*y
    else:
        cost += (n/k)*x
    return cost

n,m = RI()
x,k,y = RI()
arr = [0]+RI()+[0]
brr = [0]+RI()+[0]

idx = []
j = 0
for i in xrange(m+2):
    while j<n+2:
        if arr[j]==brr[i]:
            idx.append(j)
            break
        j+=1

if len(idx)!=m+2:
    print -1
else:
    cost = 0
    for i in xrange(1,m+2):
        val = solve(arr,idx[i-1],idx[i],x,k,y)
        #print idx[i-1],idx[i],val
        if val<0:
            cost=-1
            break
        cost += val
    print cost

        
