import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt(), T = sc.nextInt();
		Map<Integer,Integer> map = new TreeMap<>();
		for(; n > 0; n--) {
			int c = sc.nextInt(), t = sc.nextInt();
			if(t <= T) {
				map.put(c, t);
			}
		}
		List<Integer> list = new ArrayList<>(map.keySet());
		if(list.size() == 0)System.out.println("TLE");
		else System.out.println(list.get(0));
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz