CF1380D.Berserk And Fireball

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, \dots, a_n$ into $b_1, b_2, \dots, b_m$. Calculate the minimum amount of mana you need to spend on it.

一行中有 $n$ 名战士。第 $i$ 名战士的力量为 $a_i$，所有力量值两两互不相同。

你可以施放两种类型的法术：

1. 火球术：消耗 $x$ 点法力值，消灭恰好 $k$ 个连续的战士；
2. 狂暴术：消耗 $y$ 点法力值，选择两名相邻的战士，其中力量值较大的战士消灭力量值较小的战士。

例如，设战士的力量序列为 $[2, 3, 7, 8, 11, 5, 4]$，且 $k = 3$。若对力量值为 $8$ 和 $11$ 的两名相邻战士施放狂暴术，则力量序列变为 $[2, 3, 7, 11, 5, 4]$。接着，例如对力量值为 $[7, 11, 5]$ 的三个连续战士施放火球术，则力量序列变为 $[2, 3, 4]$。

你希望将当前战士力量序列 $a_1, a_2, \dots, a_n$ 变为目标序列 $b_1, b_2, \dots, b_m$。请计算实现该目标所需的最小法力值消耗。

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

The second line contains three integers $x, k, y$ ($1 \le x, y, \le 10^9; 1 \le k \le 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, \dots, a_n$ ($1 \le a_i \le n$). It is guaranteed that all integers $a_i$ are pairwise distinct.

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

第一行包含两个整数 $n$ 和 $m$（$1 \le n, m \le 2 \cdot 10^5$），分别表示序列 $a$ 和序列 $b$ 的长度。

第二行包含三个整数 $x, k, y$（$1 \le x, y \le 10^9; \, 1 \le k \le n$），分别表示火球术的花费、火球术的作用范围以及狂暴术的花费。

第三行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le n$）。保证所有 $a_i$ 两两不同。

第四行包含 $m$ 个整数 $b_1, b_2, \dots, b_m$（$1 \le b_i \le n$）。保证所有 $b_i$ 两两不同。

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

输出将序列 $a_1, a_2, \dots, a_n$ 变为 $b_1, b_2, \dots, b_m$ 所需的最少法力值；若无法实现，则输出 $-1$。