Problem:
Score : 200 points

Problem Statement

When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.

You, the smartwatch, has found N routes to his home.

If Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.

Find the smallest cost of a route that takes not longer than time T.

Constraints

All values in input are integers.

1 \leq N \leq 100

1 \leq T \leq 1000

1 \leq c_i \leq 1000

1 \leq t_i \leq 1000

The pairs (c_i, t_i) are distinct.

Input

Input is given from Standard Input in the following format:

N T
c_1 t_1
c_2 t_2
:
c_N t_N

Output

Print the smallest cost of a route that takes not longer than time T.

If there is no route that takes not longer than time T, print TLE instead.

Sample Input 1

3 70
7 60
1 80
4 50

Sample Output 1

4

The first route gets him home at cost 7.

The second route takes longer than time T = 70.

The third route gets him home at cost 4.

Thus, the cost 4 of the third route is the minimum.

Sample Input 2

4 3
1 1000
2 4
3 1000
4 500

Sample Output 2

TLE

There is no route that takes not longer than time T = 3.

Sample Input 3

5 9
25 8
5 9
4 10
1000 1000
6 1

Sample Output 3

5

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class Main {

	public static void main(String[] args) throws IOException{
		// TODO Auto-generated method stub
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		
		String s = reader.readLine();
		String[] inp = s.split(" ");
		int N,T;
		
		N=Integer.parseInt(inp[0]);
		T=Integer.parseInt(inp[1]);
			
		
		//ArrayList<Integer> arr = new ArrayList<Integer>();
		//HashMap<Integer,Integer> hm=new HashMap<Integer,Integer>();
		int t=N;
		
		int[] carr = new int[N];
		int[] t1arr = new int[N];
		int i=0;
		
		while(t-->0)
		{
			String p = reader.readLine();
			String[] par = p.split(" ");
			int c,t1;
			
			c=Integer.parseInt(par[0]);
			t1=Integer.parseInt(par[1]);
			
			carr[i]=c;
			t1arr[i]=t1;
			i++;
						
		}
	
		int max = 0;
		
		for(int i1 = 0; i1 < carr.length; i1++)
        {
            if(max < carr[i1])
            {
                max = carr[i1];
            }
        }
		
		int ans=0;
		int prevcost=max;
		
		
		for (int j = 0; j < t1arr.length; j++) 
		{
			int cost = carr[j];
			int time = t1arr[j];
			
			if(time<=T)
			{
				if(cost<prevcost)
				{
					ans=cost;
					prevcost=cost;
				}
			}
		}		
		
		if(prevcost==max)
			System.out.println("TLE");
		else
			System.out.println(ans);
		

	}

}