Score : 200 points
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.
Input is given from Standard Input in the following format:
N T c_1 t_1 c_2 t_2 : c_N t_N
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.
3 70 7 60 1 80 4 50
4
Thus, the cost 4 of the third route is the minimum.
4 3 1 1000 2 4 3 1000 4 500
TLE
There is no route that takes not longer than time T = 3.
5 9 25 8 5 9 4 10 1000 1000 6 1
5