Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Order Book

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIn this task you need to process a set of stock exchange orders and use them to create order book.

An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number *i* has price *p*_{i}, direction *d*_{i} — buy or sell, and integer *q*_{i}. This means that the participant is ready to buy or sell *q*_{i} stocks at price *p*_{i} for one stock. A value *q*_{i} is also known as a volume of an order.

All orders with the same price *p* and direction *d* are merged into one aggregated order with price *p* and direction *d*. The volume of such order is a sum of volumes of the initial orders.

An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.

An order book of depth *s* contains *s* best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than *s* aggregated orders for some direction then all of them will be in the final order book.

You are given *n* stock exhange orders. Your task is to print order book of depth *s* for these orders.

Input

The input starts with two positive integers *n* and *s* (1 ≤ *n* ≤ 1000, 1 ≤ *s* ≤ 50), the number of orders and the book depth.

Next *n* lines contains a letter *d*_{i} (either 'B' or 'S'), an integer *p*_{i} (0 ≤ *p*_{i} ≤ 10^{5}) and an integer *q*_{i} (1 ≤ *q*_{i} ≤ 10^{4}) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order.

Output

Print no more than 2*s* lines with aggregated orders from order book of depth *s*. The output format for orders should be the same as in input.

Examples

Input

6 2

B 10 3

S 50 2

S 40 1

S 50 6

B 20 4

B 25 10

Output

S 50 8

S 40 1

B 25 10

B 20 4

Note

Denote (x, y) an order with price *x* and volume *y*. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.

You need to print no more than two best orders for each direction, so you shouldn't print the order (10 3) having the worst price among buy orders.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/11/2021 01:39:51 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|