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

public class Main {
	
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        int T = sc.nextInt();
        
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < N; i++) {
        	int cost = sc.nextInt();
        	int time = sc.nextInt();
        	if (T >= time) {
        		min = Math.min(min, cost);
        	}
        }
        
        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