import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int maxt = sc.nextInt();
		int[] c = new int[n];
		int[] t = new int[n];
		int minc = 0;
		int minct = 0;
		for (int i = 0; i < n; i++) {
			c[i] = sc.nextInt();
			t[i] = sc.nextInt();
			if (i == 0) {
				minc = c[i];
				minct = t[i];
			} else {
				if (t[i] <= maxt) {
					if (c[i] < minc) {
						minc = c[i];
						minct = t[i];
					}
				}
			}
		}
		if (minct > maxt) {
			System.out.println("TLE");
		} else {
			System.out.println(minc);
		}
 	}
}

/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