#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
  long long int t = 1;
  while (t--) {
    long long int n, i, j, m;
    cin >> n >> m;
    long long int x, k, y;
    cin >> x >> k >> y;
    long long int arr[n];
    long long int brr[m];
    unordered_map<long long int, long long int> mp;
    for (i = 0; i < n; i++) {
      cin >> arr[i];
      mp[arr[i]] = i;
    }
    for (i = 0; i < m; i++) cin >> brr[i];
    long long int ans = 1;
    long long int minind = -1;
    vector<long long int> indxs;
    for (i = 0; i < m; i++) {
      auto it = mp.find(brr[i]);
      if (it == mp.end()) {
        ans = -1;
      } else {
        if (it->second < minind) {
          ans = -1;
        } else {
          indxs.push_back(it->second);
          minind = it->second;
        }
      }
    }
    if (ans == -1) {
      cout << ans << '\n';
      continue;
    }
    if (ans == 1 && m == n) {
      cout << 0 << '\n';
      continue;
    }
    long long int start = 0;
    long long int end = indxs[0];
    long long int gap = end - start;
    long long int max_win = INT_MIN;
    long long int cost = 0;
    for (i = 0; i < indxs.size(); i++) {
      max_win = INT_MIN;
      end = indxs[i];
      if (i == 0) {
        start = 0;
      }
      for (j = start; j < end; j++) {
        max_win = max(arr[j], max_win);
      }
      int flag = 1;
      if (i == 0) {
        if (max_win > arr[end]) {
          flag = 0;
        }
      } else {
        if (max_win > arr[start - 1] && max_win > arr[end]) {
          flag = 0;
        }
      }
      gap = end - start;
      if (gap == 0) {
        start = end + 1;
        continue;
      }
      if (gap < k && flag == 0) {
        ans = -1;
        break;
      }
      long long int rem = gap % k;
      cost += (rem * y);
      gap -= rem;
      if (flag == 1) {
        long long int bcost = gap * y;
        long long int fcost = (gap / k) * x;
        cost += min(fcost, bcost);
      } else {
        long long int segs = gap / k;
        if (segs > 1) {
          long long int config1_cost = x + ((segs - 1) * k) * y;
          long long int config2_cost = segs * x;
          cost += min(config1_cost, config2_cost);
        } else {
          long long int fcost = (gap / k) * x;
          cost += fcost;
        }
      }
      start = end + 1;
    }
    if (ans == -1) {
      cout << -1 << '\n';
    } else {
      start = indxs[indxs.size() - 1] + 1;
      end = n - 1;
      max_win = INT_MIN;
      for (i = start; i <= end; i++) {
        max_win = max(max_win, arr[i]);
      }
      int flag = 1;
      gap = end - start + 1;
      if (max_win > arr[start - 1]) {
        flag = 0;
      }
      if (gap < k && flag == 0) {
        ans = -1;
        cout << -1 << '\n';
        continue;
      }
      long long int rem = gap % k;
      cost += (rem * y);
      gap -= rem;
      if (flag == 1) {
        long long int bcost = gap * y;
        long long int fcost = (gap / k) * x;
        cost += min(fcost, bcost);
      } else {
        long long int segs = gap / k;
        if (segs > 1) {
          long long int config1_cost = x + ((segs - 1) * k) * y;
          long long int config2_cost = segs * x;
          cost += min(config1_cost, config2_cost);
        } else {
          long long int fcost = (gap / k) * x;
          cost += fcost;
        }
      }
      cout << cost << '\n';
    }
  }
  return 0;
}

### Prompt

Your task is to create a cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main() {
  long long int t = 1;
  while (t--) {
    long long int n, i, j, m;
    cin >> n >> m;
    long long int x, k, y;
    cin >> x >> k >> y;
    long long int arr[n];
    long long int brr[m];
    unordered_map<long long int, long long int> mp;
    for (i = 0; i < n; i++) {
      cin >> arr[i];
      mp[arr[i]] = i;
    }
    for (i = 0; i < m; i++) cin >> brr[i];
    long long int ans = 1;
    long long int minind = -1;
    vector<long long int> indxs;
    for (i = 0; i < m; i++) {
      auto it = mp.find(brr[i]);
      if (it == mp.end()) {
        ans = -1;
      } else {
        if (it->second < minind) {
          ans = -1;
        } else {
          indxs.push_back(it->second);
          minind = it->second;
        }
      }
    }
    if (ans == -1) {
      cout << ans << '\n';
      continue;
    }
    if (ans == 1 && m == n) {
      cout << 0 << '\n';
      continue;
    }
    long long int start = 0;
    long long int end = indxs[0];
    long long int gap = end - start;
    long long int max_win = INT_MIN;
    long long int cost = 0;
    for (i = 0; i < indxs.size(); i++) {
      max_win = INT_MIN;
      end = indxs[i];
      if (i == 0) {
        start = 0;
      }
      for (j = start; j < end; j++) {
        max_win = max(arr[j], max_win);
      }
      int flag = 1;
      if (i == 0) {
        if (max_win > arr[end]) {
          flag = 0;
        }
      } else {
        if (max_win > arr[start - 1] && max_win > arr[end]) {
          flag = 0;
        }
      }
      gap = end - start;
      if (gap == 0) {
        start = end + 1;
        continue;
      }
      if (gap < k && flag == 0) {
        ans = -1;
        break;
      }
      long long int rem = gap % k;
      cost += (rem * y);
      gap -= rem;
      if (flag == 1) {
        long long int bcost = gap * y;
        long long int fcost = (gap / k) * x;
        cost += min(fcost, bcost);
      } else {
        long long int segs = gap / k;
        if (segs > 1) {
          long long int config1_cost = x + ((segs - 1) * k) * y;
          long long int config2_cost = segs * x;
          cost += min(config1_cost, config2_cost);
        } else {
          long long int fcost = (gap / k) * x;
          cost += fcost;
        }
      }
      start = end + 1;
    }
    if (ans == -1) {
      cout << -1 << '\n';
    } else {
      start = indxs[indxs.size() - 1] + 1;
      end = n - 1;
      max_win = INT_MIN;
      for (i = start; i <= end; i++) {
        max_win = max(max_win, arr[i]);
      }
      int flag = 1;
      gap = end - start + 1;
      if (max_win > arr[start - 1]) {
        flag = 0;
      }
      if (gap < k && flag == 0) {
        ans = -1;
        cout << -1 << '\n';
        continue;
      }
      long long int rem = gap % k;
      cost += (rem * y);
      gap -= rem;
      if (flag == 1) {
        long long int bcost = gap * y;
        long long int fcost = (gap / k) * x;
        cost += min(fcost, bcost);
      } else {
        long long int segs = gap / k;
        if (segs > 1) {
          long long int config1_cost = x + ((segs - 1) * k) * y;
          long long int config2_cost = segs * x;
          cost += min(config1_cost, config2_cost);
        } else {
          long long int fcost = (gap / k) * x;
          cost += fcost;
        }
      }
      cout << cost << '\n';
    }
  }
  return 0;
}

```