import java.util.*;
public class Main {

		static void solve() {
			Scanner sc = new Scanner(System.in);
			int n = sc.nextInt();
			int T = sc.nextInt();
			int[] c = new int[n];
			int[] t = new int[n];
			int res = 0;
			int min = Integer.MAX_VALUE;
			for(int i = 0;i<n;i++) {
				c[i] = sc.nextInt();
				t[i] = sc.nextInt();
			}
			for(int i = 0;i<n;i++) {
				if(t[i]<=T) {
					if(min>c[i]) {
					min = c[i];
					res = c[i];
					}
				}
			}
			if(res == 0) {
				System.out.println("TLE");
			}else
			System.out.println(res);
			
			sc.close();
			
		}
	public static void main(String[] args) {
		solve();
	}

}

/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