import java.util.Scanner;

public class Main {
    static final int INF = (int)Math.pow(10, 9);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    }
} import java.util.Scanner; Scanner java.util public class Main {
    static final int INF = (int)Math.pow(10, 9);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    }
} Main static final int INF = (int)Math.pow(10, 9); INF (int)Math.pow(10, 9) Math.pow Math 10 9 public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    } 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[] c = new int[N]; c new int[N] N int[] t = new int[N]; t new int[N] N int min_cost = INF; min_cost INF for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        } {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        } c[i] = sc.nextInt() c[i] c i sc.nextInt() sc.nextInt sc t[i] = sc.nextInt() t[i] t i sc.nextInt() sc.nextInt sc if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            } t[i] <= T t[i] t i T {
                min_cost = Math.min(min_cost, c[i]);
            } min_cost = Math.min(min_cost, c[i]) min_cost Math.min(min_cost, c[i]) Math.min Math min_cost c[i] c i if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        } min_cost == INF min_cost INF {
            System.out.println("TLE");
        } System.out.println("TLE") System.out.println System.out System System.out "TLE" {
            System.out.println(min_cost);
        } System.out.println(min_cost) System.out.println System.out System System.out min_cost sc.close() sc.close sc String[] args args public class Main {
    static final int INF = (int)Math.pow(10, 9);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    }
} public class Main {
    static final int INF = (int)Math.pow(10, 9);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    }
} Main
import java.util.Scanner;

public class Main {
    static final int INF = (int)Math.pow(10, 9);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int[] c = new int[N];
        int[] t = new int[N];
        int min_cost = INF;
        for (int i = 0; i < N; i++) {
            c[i] = sc.nextInt();
            t[i] = sc.nextInt();
            if (t[i] <= T) {
                min_cost = Math.min(min_cost, c[i]);
            }
        }
        if (min_cost == INF) {
            System.out.println("TLE");
        } else {
            System.out.println(min_cost);
        }
        sc.close();
    }
}