import java.util.Scanner;

public class Main{
    public static void main(String[] args){
	Scanner scan = new Scanner(System.in);

	int N;   //経路数
	int T;   //最大時間

	N = scan.nextInt();
	T = scan.nextInt();

	int[] c = new int[N];   //コスト
	int[] t = new int[N];   //時間

	for(int i = 0; i < N; i++){
	    c[i] = scan.nextInt();
	    t[i] = scan.nextInt();
	}

	int min = 1001;   //最小コスト(初期値は境界の値)

	for(int i = 0; i < N; i++){
	    if(t[i] <= T){
		if(c[i] < min){
		    min = c[i];
		}
	    }
	}

	//最小経路が更新された場合
	if(min < 1001){
	    System.out.println(min);
	}else{
	    System.out.println("TLE");
	}
    }
}
	    

/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