import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
    static int gcd(int a, int b) {
        if (a % b != 0) {
            return gcd(b, a % b);
        } else {
            return b;
        }

    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int count = 0;
        int max = Integer.MAX_VALUE;
        int n = sc.nextInt();
        int t = sc.nextInt();
        int[] nl = new int[n];
        int[] tl = new int[n];
        int index = 0;
        for (int i = 0; i < n; i++) {
            nl[i] = sc.nextInt();
            tl[i] = sc.nextInt();
            if (tl[i] <= t && nl[i] < max) {
                max = nl[i];
            }
        }

        if (max == Integer.MAX_VALUE) {
            System.out.println("TLE");
        } else {
            System.out.println(max);
        }

    }
}
/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