import java.net.SecureCacheResponse;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int t = sc.nextInt();

        int[][] matrix = new int[n][2];


        for (int i = 0; i < n; i++) {
            matrix[i][0] = sc.nextInt();// cost
            matrix[i][1] = sc.nextInt();// time
        }

        int minCost = Integer.MAX_VALUE;
        for (int i = 0; i < n; i++) {
            if (matrix[i][1] <= t) {// 時間内
                minCost = Math.min(minCost, matrix[i][0]);
            }
        }

        System.out.println(minCost == Integer.MAX_VALUE ? "TLE" : minCost);
    }
}

/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