n = gets.to_i
t = gets.to_i

i = 1
while i <= n
  cost[i] = gets.to_i
  time[i] = gets.to_i
end

i = 1
while i <= n
  down[i] = cost[i] if time[i] < t
end

if down.size == 0
  print "TLE"
else
  i = 1
  while i <= n
    j = 1
    while j <= n
      if down[i] == cost[j]
        down2[i] == time[j]
      end
    end
  end
  i = 1
  while i <= n
    min = (min > down[i]) down[i] : min
  end
end