|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||128 MB||1||1||1||100.000%|
Byteotian State Railways decided to keep up with the times and introduce to their offer an InterCity connection. Because of lack of efficient engines, clean carriages and straight tracks it was possible to establish only one such a connection. The lack of any computer system for seat reservation was another obstacle. Writing the main part of this system is your task.
For simplicity we assume that the InterCity connection runs through cities numbered successively from 1 to c (the starting city has the number 1, and c is the number of the ending city). There are s seats in the train and transporting more passengers between any two successive stations is not allowed.
The computer system is to receive successive requests and determine whether they may be fulfilled. A request is accepted when in the given section of the railway line there is enough vacant seats in the train. Otherwise it is rejected. Partial accepting of a request is not allowed, e.g. for a part of a route or for less passengers. After accepting a request, the number of vacant seats in the train is updated. The requests are processed successively in the order of coming.
Write a program which:
In the first line of the standard input there are three integers c, s and r (1 ≤ c ≤ 60,000, 1 ≤ s ≤ 60,000, 1 ≤ r ≤ 60,000) separated by single spaces. The numbers denote respectively: the number of cities on the railway line, the number of seats in the train, and the number of requests. In the following r lines there are consecutive requests written. In the line of number i+1 there is the i-th request described. The description consists of three integers o, d and n (1 ≤ o < d ≤ c, 1 ≤ n ≤ s) separated by single spaces. They denote: the number of the station of origin, the number of the destination station and the requested number of seats, respectively.
Your program should write r lines to the standard output. In the i-th line there should be exactly one character:
4 6 4 1 4 2 1 3 2 2 4 3 1 2 3
T T N N