import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = Integer.parseInt(sc.next());
		int t = Integer.parseInt(sc.next());
		
		Map<Integer, Integer> map = new HashMap<Integer,Integer>();
		
		for(int i = 0; i < n; i++) {
			int c = Integer.parseInt(sc.next());
			int time = Integer.parseInt(sc.next());
			
			if(time <= t) {
				map.put(c, time);
			}
		}
		
		int min = Integer.MAX_VALUE;
		
		for(Map.Entry<Integer, Integer> entry : map.entrySet()) {
			min = Math.min(entry.getKey(), min);
		}
		
		System.out.println(min == Integer.MAX_VALUE ? "TLE" : min);
		
	}
}

/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