import java.util.*;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int numRoutes = sc.nextInt();
        int timeLimit = sc.nextInt();

        int[] c = new int[numRoutes];
        int[] t = new int[numRoutes];

        for (int i = 0; i < numRoutes; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
        }

        int optimalRoute = -1;
        for (int i = 0; i < numRoutes; i++) {
            if (t[i] > timeLimit) {
                continue;
            }

            if (optimalRoute == -1) {
                optimalRoute = i;
                continue;
            }

            if (c[i] < c[optimalRoute]) {
                optimalRoute = i;
            }
        }

        if (optimalRoute == -1) {
            System.out.println("TLE");
        } else {
            System.out.println(c[optimalRoute]);
        }

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