---{"category_name":"easy","problem_code":"FGFS","problem_name":"Bon Appetit","languages_supported":{"0":"ADA","1":"ASM","2":"BASH","3":"BF","4":"C","5":"C99 strict","6":"CAML","7":"CLOJ","8":"CLPS","9":"CPP 4.3.2","10":"CPP 4.9.2","11":"CPP14","12":"CS2","13":"D","14":"ERL","15":"FORT","16":"FS","17":"GO","18":"HASK","19":"ICK","20":"ICON","21":"JAVA","22":"JS","23":"LISP clisp","24":"LISP sbcl","25":"LUA","26":"NEM","27":"NICE","28":"NODEJS","29":"PAS fpc","30":"PAS gpc","31":"PERL","32":"PERL6","33":"PHP","34":"PIKE","35":"PRLG","36":"PYTH","37":"PYTH 3.4","38":"RUBY","39":"SCALA","40":"SCM guile","41":"SCM qobi","42":"ST","43":"TCL","44":"TEXT","45":"WSPC"},"max_timelimit":0.5,"source_sizelimit":50000,"problem_author":"viv001","problem_tester":"gerald","date_added":"7-12-2013","tags":{"0":"easy","1":"greedy","2":"jan14","3":"sorting","4":"viv001"},"editorial_url":"http://discuss.codechef.com/problems/FGFS","time":{"view_start_date":1389605400,"submit_start_date":1389605400,"visible_start_date":1389605400,"end_date":1735669800},"layout":"problem"}---<span class="solution-visible-txt">All submissions for this problem are available.</span><h3> Read problems statements in <a target="_blank" href="http://www.codechef.com/download/translated/JAN14/mandarin/FGFS.pdf">Mandarin Chinese </a> and <a target="_blank" href="http://www.codechef.com/download/translated/JAN14/russian/FGFS1.pdf">Russian</a>.</h3><p> Our chef has recently opened a new restaurant with a unique style. The restaurant is divided into <b>K</b> compartments (numbered from <b>1</b> to <b>K</b>) and each compartment can be occupied by at most one customer. </p><p> Each customer that visits the restaurant has a strongly preferred compartment <b>p</b> (<b>1 ≤ p ≤ K</b>), and if that compartment is already occupied, then the customer simply leaves. Now obviously, the chef wants to maximize the total number of customers that dine at his restaurant and so he allows (or disallows) certain customers so as to achieve this task. You are to help him with this. </p><p> Given a list of <b>N</b> customers with their arrival time, departure time and the preferred compartment, you need to calculate the maximum number of customers that can dine at the restaurant. </p><h3>Input</h3><p> The first line contains an integer <b>T</b> denoting the number of test cases. Each of the next <b>T</b> lines contains two integers <b>N</b> and <b> K </b>, the number of customers that plan to visit the chef's restaurant and the number of compartments the restaurant is divided into respectively. Each of the next <b>N</b> lines contains three integers <b>s<sub>i</sub></b>, <b>f<sub>i</sub></b> and <b>p<sub>i</sub></b> , the arrival time, departure time and the strongly preferred compartment of the <b>i<sup>th</sup></b> customer respectively. <br/><br />Note that the <b>i<sup>th</sup></b> customer wants to occupy the <b>p<sub>i</sub><sup>th</sup></b> compartment from <b>[s<sub>i</sub>, f<sub>i</sub>) </b> i.e the <b>i<sup>th</sup></b> customer leaves just before <b> f<sub>i</sub> </b> so that another customer can occupy that compartment from <b> f<sub>i</sub> </b> onwards.</br/></p><h3>Output</h3><p> For every test case, print in a single line the maximum number of customers that dine at the restaurant.</p><h3>Constraints</h3><ul><li><b> 1 </b>≤ <b>T</b> ≤ <b> 30 </b></li><li><b> 0 </b> ≤ <b>N</b> ≤ <b> 10<sup>5</sup> </b></li><li><b> 1 </b> ≤ <b> K</b> ≤ <b> 10<sup>9</sup> </b></li><li><b> 0 </b> ≤ <b>s<sub>i</sub></b> < <b>f<sub>i</sub></b> ≤ <b> 10<sup>9</sup> </b></li><li><b> 1 </b> ≤ <b> p<sub>i</sub> </b> ≤ <b> K </b> </li></ul><h3>Example</h3><pre><b>Input:</b>23 31 3 14 6 27 10 34 210 100 1100 200 2150 500 2200 300 2<b>Output:</b>33</pre><h3>Explanation</h3><p><b>Example case 1.</b><br/><br />All three customers want different compartments and hence all 3 can be accommodated.</br/></p><p><b>Example case 2.</b><br/><br />If we serve the <b>1<sup>st</sup></b>, <b>2<sup>nd</sup></b> and <b>4<sup>th</sup></b> customers, then we can get a maximum of 3.</br/></p>