output_description: 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.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N T
      c_1 t_1
      c_2 t_2
      :
      c_N t_N
attempt: nt = input().split()
  ct = [0]
  for i in range(int(nt[0])):
      inp = input().split()
      if int(inp[1]) <= int(nt[1]):
          ct.append(int(inp[0]))
  print(ct)
  ct.sort()
  print(ct)
  if len(ct) == 1:
      print("TLE")
  else:
      print(ct[1])
  
problem_description: 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.
samples: [{"input": "3 70\n    7 60\n    1 80\n    4 50", "output": "4\n    \n\n  * The first route gets him home at cost 7.\n  * The second route takes longer than time T = 70.\n  * The third route gets him home at cost 4.\n\nThus, the cost 4 of the third route is the minimum.\n\n* * *"}, {"input": "4 3\n    1 1000\n    2 4\n    3 1000\n    4 500", "output": "TLE\n    \n\nThere is no route that takes not longer than time T = 3.\n\n* * *"}, {"input": "5 9\n    25 8\n    5 9\n    4 10\n    1000 1000\n    6 1", "output": "5"}]