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);
    }
} import java.net.SecureCacheResponse; SecureCacheResponse java.net import java.util.*; util.* java 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);
    }
} 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);
    } main {
        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);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int t = sc.nextInt(); t sc.nextInt() sc.nextInt sc int[][] matrix = new int[n][2]; matrix new int[n][2] n 2 for (int i = 0; i < n; i++) {
            matrix[i][0] = sc.nextInt();// cost
            matrix[i][1] = sc.nextInt();// time
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            matrix[i][0] = sc.nextInt();// cost
            matrix[i][1] = sc.nextInt();// time
        } {
            matrix[i][0] = sc.nextInt();// cost
            matrix[i][1] = sc.nextInt();// time
        } matrix[i][0] = sc.nextInt() matrix[i][0] matrix[i] matrix i 0 sc.nextInt() sc.nextInt sc matrix[i][1] = sc.nextInt() matrix[i][1] matrix[i] matrix i 1 sc.nextInt() sc.nextInt sc int minCost = Integer.MAX_VALUE; minCost Integer.MAX_VALUE Integer Integer.MAX_VALUE for (int i = 0; i < n; i++) {
            if (matrix[i][1] <= t) {// 時間内
                minCost = Math.min(minCost, matrix[i][0]);
            }
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            if (matrix[i][1] <= t) {// 時間内
                minCost = Math.min(minCost, matrix[i][0]);
            }
        } {
            if (matrix[i][1] <= t) {// 時間内
                minCost = Math.min(minCost, matrix[i][0]);
            }
        } if (matrix[i][1] <= t) {// 時間内
                minCost = Math.min(minCost, matrix[i][0]);
            } matrix[i][1] <= t matrix[i][1] matrix[i] matrix i 1 t {// 時間内
                minCost = Math.min(minCost, matrix[i][0]);
            } minCost = Math.min(minCost, matrix[i][0]) minCost Math.min(minCost, matrix[i][0]) Math.min Math minCost matrix[i][0] matrix[i] matrix i 0 System.out.println(minCost == Integer.MAX_VALUE ? "TLE" : minCost) System.out.println System.out System System.out minCost == Integer.MAX_VALUE ? "TLE" : minCost minCost == Integer.MAX_VALUE minCost Integer.MAX_VALUE Integer Integer.MAX_VALUE "TLE" minCost String[] args args 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);
    }
} 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);
    }
} Main
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);
    }
}
