Fox Ciel is playing a card game with her friend Jiro. Jiro has n cards, each one has two attributes: position (Attack or Defense) and strength . Fox Ciel has m cards, each one has these two attributes too. It's known that position of all Ciel's cards is Attack. Now is Ciel's battle phase, Ciel can do the following operation many times: Choose one of her cards X . This card mustn't be chosen before. If Jiro has no alive cards at that moment, he gets the damage equal to ( X 's strength). Otherwise, Ciel needs to choose one Jiro's alive card Y , then: If Y 's position is Attack, then ( X 's strength) ≥ ( Y 's strength) must hold. After this attack, card Y dies, and Jiro gets the damage equal to ( X 's strength) - ( Y 's strength). If Y 's position is Defense, then ( X 's strength) > ( Y 's strength) must hold. After this attack, card Y dies, but Jiro gets no damage. If Y 's position is Attack, then ( X 's strength) ≥ ( Y 's strength) must hold. After this attack, card Y dies, and Jiro gets the damage equal to ( X 's strength) - ( Y 's strength). If Y 's position is Defense, then ( X 's strength) > ( Y 's strength) must hold. After this attack, card Y dies, but Jiro gets no damage. Ciel can end her battle phase at any moment (so, she can use not all her cards). Help the Fox to calculate the maximal sum of damage Jiro can get. The first line contains two integers n and m ( 1 ≤ n , m ≤ 100 ) — the number of cards Jiro and Ciel have. Each of the next n lines contains a string position and an integer strength (0 ≤ strength ≤ 8000) — the position and strength of Jiro's current card. Position is the string " ATK " for attack, and the string " DEF " for defense. Each of the next m lines contains an integer strength ( 0 ≤ strength ≤ 8000 ) — the strength of Ciel's current card. Output an integer: the maximal damage Jiro can get. In the first test case, Ciel has 3 cards with same strength . The best strategy is as follows. First she uses one of these 3 cards to attack