#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, n1;
  cin >> n >> n1;
  long long int a[n + 2], b[n1 + 2];
  long long int x, k, y, ans = 0, i, j, v, flag = 0, high, low, max1 = 0;
  cin >> x >> k >> y;
  unordered_map<long long int, long long int> m1;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    m1[a[i]] = i;
  }
  a[0] = 0;
  a[n + 1] = 0;
  b[0] = 0;
  for (i = 1; i <= n1; i++) {
    cin >> b[i];
    if (m1[b[i]] < m1[b[i - 1]] || m1[b[i]] == 0) flag = 1;
  }
  if (flag != 1) {
    b[0] = a[1];
    b[n1 + 1] = a[n];
    for (i = 0; i <= n1; i++) {
      low = m1[b[i]];
      ;
      high = m1[b[i + 1]];
      if (i == 0) {
        if (low == high)
          continue;
        else {
          high--;
        }
      } else if (i == n1) {
        if (low == high)
          break;
        else
          low++;
      } else {
        low++;
        high--;
      }
      if ((high - low + 1) / k != 0) {
        if ((high - low + 1) % k == 0) {
          if (x <= y * k) {
            ans = ans + (x * ((high - low + 1) / k));
          } else {
            max1 = 0;
            for (j = low; j <= high; j++) {
              max1 = max(max1, a[j]);
            }
            if (max1 < a[low - 1] || max1 < a[high + 1]) {
              ans = ans + y * (high - low + 1);
            } else {
              ans = ans + x + (high - low + 1 - k) * y;
            }
          }
        } else {
          if ((high - low + 1) % k != 0) {
            if (x <= y * k) {
              ans =
                  ans + ((high - low + 1) % k) * y + ((high - low + 1) / k) * x;
            } else {
              max1 = 0;
              for (j = low; j <= high; j++) {
                max1 = max(max1, a[j]);
              }
              if (max1 < a[low - 1] || max1 < a[high + 1]) {
                ans = ans + y * (high - low + 1);
              } else
                ans = ans + (high - low + 1 - k) * y + x;
            }
          }
        }
      } else {
        max1 = 0;
        for (j = low; j <= high; j++) {
          max1 = max(max1, a[j]);
        }
        if (max1 < a[low - 1] || max1 < a[high + 1]) {
          ans = ans + y * (high - low + 1);
        } else {
          ans = -1;
          break;
        }
      }
    }
  } else
    ans = -1;
  cout << ans << endl;
}

### Prompt

Develop a solution in Cpp to the problem described below:

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;
int main() {
  long long int n, n1;
  cin >> n >> n1;
  long long int a[n + 2], b[n1 + 2];
  long long int x, k, y, ans = 0, i, j, v, flag = 0, high, low, max1 = 0;
  cin >> x >> k >> y;
  unordered_map<long long int, long long int> m1;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    m1[a[i]] = i;
  }
  a[0] = 0;
  a[n + 1] = 0;
  b[0] = 0;
  for (i = 1; i <= n1; i++) {
    cin >> b[i];
    if (m1[b[i]] < m1[b[i - 1]] || m1[b[i]] == 0) flag = 1;
  }
  if (flag != 1) {
    b[0] = a[1];
    b[n1 + 1] = a[n];
    for (i = 0; i <= n1; i++) {
      low = m1[b[i]];
      ;
      high = m1[b[i + 1]];
      if (i == 0) {
        if (low == high)
          continue;
        else {
          high--;
        }
      } else if (i == n1) {
        if (low == high)
          break;
        else
          low++;
      } else {
        low++;
        high--;
      }
      if ((high - low + 1) / k != 0) {
        if ((high - low + 1) % k == 0) {
          if (x <= y * k) {
            ans = ans + (x * ((high - low + 1) / k));
          } else {
            max1 = 0;
            for (j = low; j <= high; j++) {
              max1 = max(max1, a[j]);
            }
            if (max1 < a[low - 1] || max1 < a[high + 1]) {
              ans = ans + y * (high - low + 1);
            } else {
              ans = ans + x + (high - low + 1 - k) * y;
            }
          }
        } else {
          if ((high - low + 1) % k != 0) {
            if (x <= y * k) {
              ans =
                  ans + ((high - low + 1) % k) * y + ((high - low + 1) / k) * x;
            } else {
              max1 = 0;
              for (j = low; j <= high; j++) {
                max1 = max(max1, a[j]);
              }
              if (max1 < a[low - 1] || max1 < a[high + 1]) {
                ans = ans + y * (high - low + 1);
              } else
                ans = ans + (high - low + 1 - k) * y + x;
            }
          }
        }
      } else {
        max1 = 0;
        for (j = low; j <= high; j++) {
          max1 = max(max1, a[j]);
        }
        if (max1 < a[low - 1] || max1 < a[high + 1]) {
          ans = ans + y * (high - low + 1);
        } else {
          ans = -1;
          break;
        }
      }
    }
  } else
    ans = -1;
  cout << ans << endl;
}

```