Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

The Maximum Number of Customers

$N$ persons visited a restaurant. The restaurant is open from 0 to $T$. The $i$-th person entered the restaurant at $l_i$ and left at $r_i$. Find the maximum number of persons during the business hours.

Constraints

$ 1 \leq N \leq 10^5 $

$ 1 \leq T \leq 10^5 $

$ 0 \leq l_i < r_i \leq T $

Input

The input is given in the following format.

$N$ $T$

$l_1$ $r_1$

$l_2$ $r_2$

:

$l_N$ $r_N$

Output

Print the maximum number of persons in a line.

Sample Input 1

6 10
0 2
1 3
2 6
3 8
4 10
5 10

Sample Output 1

4

Sample Input 2

2 2
0 1
1 2

Sample Output 2

1

Solution in C (judge verdict: Time Limit Exceeded)

#include<stdio.h>

int main(void){
  int N,T,i,b;
  int max=0;
  int l[100000]={};
  int r[100000]={};
  int time[100000]={};
  scanf("%d %d",&N,&T);
 
  if(100000<N||100000<T)
   printf("Too Larage\n");

  i=0;
  while(i<=N-1){
  scanf("%d %d",&l[i],&r[i]);
  b=l[i];
  if(l[i]>r[i]||T<r[i])
  printf("Too Larage\n");

  for(b;b<r[i];b++)
  time[b]+=1;
  i++;
  }
 
  i=0;
  while(i<T){ 
    if(max<time[i])
      max=time[i];
      i++;
  }

  printf("%d\n",max);


}