Problem: Little W and Little P decided to send letters to each other regarding the most important events during a day. There are n events during a day: at time moment t_i something happens to the person p_i (p_i is either W or P, denoting Little W and Little P, respectively), so he needs to immediately send a letter to the other person. They can send a letter using one of the two ways:

  * Ask Friendly O to deliver the letter directly. Friendly O takes d acorns for each letter.
  * Leave the letter at Wise R's den. Wise R values free space, so he takes c ⋅ T acorns for storing a letter for a time segment of length T. The recipient can take a letter from Wise R either when he leaves his own letter at Wise R's den, or at time moment t_{n + 1}, when everybody comes to Wise R for a tea. It is not possible to take a letter from Wise R's den at other time moments. The friends can store as many letters at Wise R's den as they want, paying for each one separately. 



Help the friends determine the minimum possible total cost of sending all letters.

Input

The first line contains three integers n, c, d (1 ≤ n ≤ 10^5, 1 ≤ c ≤ 10^2, 1 ≤ d ≤ 10^8) — the number of letters, the cost of storing a letter for one time unit at Wise R's den and the cost of delivering a letter via Friendly O.

The next n describe the events. The i-th of them contains an integer t_i and a character p_i (0 ≤ t_i ≤ 10^6, p_i is either W or P) — the time the i-th event happens and the person the event happens to.

The last line contains a single integer t_{n + 1} (0 ≤ t_{n+1} ≤ 10^6) — the time when everybody comes to Wise R for a tea and takes all remaining letters. 

It is guaranteed that t_i < t_{i + 1} for all i from 1 to n.

Output

Print a single integer — the minimum possible cost of delivery of all letters.

Examples

Input


5 1 4
0 P
1 W
3 P
5 P
8 P
10


Output


16


Input


10 10 94
17 W
20 W
28 W
48 W
51 P
52 W
56 W
62 P
75 P
78 P
87


Output


916

Note

One of optimal solutions in the first example:

  * At time moment 0 Little P leaves the letter at Wise R's den.
  * At time moment 1 Little W leaves his letter at Wise R's den and takes Little P's letter. This letter is at the den from time moment 0 to time moment 1, it costs 1 acorn.
  * At time moment 3 Little P sends his letter via Friendly O, it costs 4 acorns.
  * At time moment 5 Little P leaves his letter at the den, receiving Little W's letter which storage costs 4 acorns.
  * At time moment 8 Little P leaves one more letter at the den.
  * At time moment 10 Little W comes to the den for a tea and receives the two letters, paying 5 and 2 acorns.



The total cost of delivery is thus 1 + 4 + 4 + 5 + 2 = 16 acorns.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline void proc_status() {
  ifstream t("/proc/self/status");
  cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
       << endl;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline T read() {
  register T sum(0), fg(1);
  register char ch(getchar());
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') fg = -1;
  for (; isdigit(ch); ch = getchar()) sum = sum * 10 - '0' + ch;
  return sum * fg;
}
const int MAXN = (int)1e5;
int n, c, d;
struct event {
  int t, type;
  event() {}
  event(int _t, int _type) : t(_t), type(_type) {}
} a[MAXN + 5];
inline char safe_getchar() {
  register char ch(getchar());
  while (!isalpha(ch)) ch = getchar();
  return ch == 'W' ? 0 : 1;
}
inline void input() {
  n = read<int>(), c = read<int>(), d = read<int>();
  for (int i = 1; i <= n; ++i) a[i].t = read<int>(), a[i].type = safe_getchar();
  a[++n] = event(read<int>(), 2);
}
inline void solve() {
  static int lst[2];
  static long long suf[MAXN + 5][2];
  lst[0] = lst[1] = n;
  long long ans = (long long)(n - 1) * d;
  for (int i = n - 1; i >= 1; --i) {
    if (a[i].type == a[i + 1].type) {
      suf[i][0] = suf[i + 1][0] + min(c * (a[lst[!a[i].type]].t - a[i].t), d);
      suf[i][1] = suf[i + 1][0] + c * (a[lst[!a[i].type]].t - a[i].t);
    } else {
      suf[i][0] = suf[i + 1][1] + min(c * (a[lst[!a[i].type]].t - a[i].t), d);
      suf[i][1] = suf[i + 1][1] + c * (a[lst[!a[i].type]].t - a[i].t);
    }
    chkmin(ans, (long long)(i - 1) * d + suf[i][1]);
    lst[a[i].type] = i;
  }
  printf("%lld\n", ans);
}
int main() {
  input();
  solve();
  return 0;
}