Arkady plays Gardenscapes a lot. Arkady wants to build two new fountains. There are n available fountains, for each fountain its beauty and cost are known. There are two types of money in the game: coins and diamonds, so each fountain cost can be either in coins or diamonds. No money changes between the types are allowed.

Help Arkady to find two fountains with maximum total beauty so that he can buy both at the same time.


-----Input-----

The first line contains three integers n, c and d (2 ≤ n ≤ 100 000, 0 ≤ c, d ≤ 100 000) — the number of fountains, the number of coins and diamonds Arkady has.

The next n lines describe fountains. Each of these lines contain two integers b_{i} and p_{i} (1 ≤ b_{i}, p_{i} ≤ 100 000) — the beauty and the cost of the i-th fountain, and then a letter "C" or "D", describing in which type of money is the cost of fountain i: in coins or in diamonds, respectively.


-----Output-----

Print the maximum total beauty of exactly two fountains Arkady can build. If he can't build two fountains, print 0.


-----Examples-----
Input
3 7 6
10 8 C
4 3 C
5 6 D

Output
9

Input
2 4 5
2 5 C
2 1 D

Output
0

Input
3 10 10
5 5 C
5 5 C
10 11 D

Output
10



-----Note-----

In the first example Arkady should build the second fountain with beauty 4, which costs 3 coins. The first fountain he can't build because he don't have enough coins. Also Arkady should build the third fountain with beauty 5 which costs 6 diamonds. Thus the total beauty of built fountains is 9.

In the second example there are two fountains, but Arkady can't build both of them, because he needs 5 coins for the first fountain, and Arkady has only 4 coins.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "n, c, d = map(int, input().split())\n\ninf = 10 ** 9\na = [0] * n\nsc = []\nsd = []\nfor i in range(n):\n    b, p, t = input().split()\n    b = int(b)\n    p = int(p)\n    \n    a[i] = [b, p, t]\n    \n    if t == 'C':\n        sc.append([p, b])\n    else:\n        sd.append([p, b])\n        \n    \nmaxc = -inf\nmaxd = -inf\nfor i in range(n):\n    if a[i][2] == 'C' and a[i][1] <= c:\n        maxc = max(maxc, a[i][0])\n        \n    if a[i][2] == 'D' and a[i][1] <= d:\n        maxd = max(maxd, a[i][0])    \n        \nans1 = maxc + maxd\n\nsc.sort()\nscpref = [0] * (len(sc) + 1)\nscpref[0] = -inf\nfor i in range(len(sc)):\n    scpref[i + 1] = max(scpref[i], sc[i][1])\n\nans2 = -inf\nfor i in range(len(sc)):\n    l = -1\n    r = i\n    while l < r - 1:\n        m = (l + r) // 2\n        if sc[m][0] <= c - sc[i][0]:\n            l = m\n        else:\n            r = m\n            \n    ans2 = max(ans2, sc[i][1] + scpref[l + 1])\n    \n    \nsd.sort()\nsdpref = [0] * (len(sd) + 1)\nsdpref[0] = -inf\nfor i in range(len(sd)):\n    sdpref[i + 1] = max(sdpref[i], sd[i][1])\n\nans3 = -inf\nfor i in range(len(sd)):\n    l = -1\n    r = i\n    while l < r - 1:\n        m = (l + r) // 2\n        if sd[m][0] <= d - sd[i][0]:\n            l = m\n        else:\n            r = m\n            \n    ans3 = max(ans3, sd[i][1] + sdpref[l + 1])\n    \n    \nans = max(ans1, ans2, ans3)\nprint(max(ans, 0))"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14395