import java.util.Scanner;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int T=sc.nextInt();
		int[][] are=new int[N][2];
		for(int i=0; i<N; i++) {
			are[i][0]=sc.nextInt();
			are[i][1]=sc.nextInt();
		}
		int cost=1145141919;
		for(int i=0; i<N; i++) {
			if(T>=are[i][1]) {
				cost=Math.min(cost, are[i][0]);
			}
		}
		if(cost==1145141919) {
			System.out.println("TLE");
		}
		else {
			System.out.println(cost);
		}
	}
}
/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