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);
        }

    }
} import java.util.Arrays; Arrays java.util import java.util.Comparator; Comparator java.util import java.util.Scanner; Scanner java.util 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);
        }

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

    } gcd {
        if (a % b != 0) {
            return gcd(b, a % b);
        } else {
            return b;
        }

    } if (a % b != 0) {
            return gcd(b, a % b);
        } else {
            return b;
        } a % b != 0 a % b a b 0 {
            return gcd(b, a % b);
        } return gcd(b, a % b); gcd(b, a % b) gcd b a % b a b {
            return b;
        } return b; b int a a int b 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);
        }

    } main {
        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);
        }

    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int count = 0; count 0 int max = Integer.MAX_VALUE; max Integer.MAX_VALUE Integer Integer.MAX_VALUE int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int t = sc.nextInt(); t sc.nextInt() sc.nextInt sc int[] nl = new int[n]; nl new int[n] n int[] tl = new int[n]; tl new int[n] n int index = 0; 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];
            }
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            nl[i] = sc.nextInt();
            tl[i] = sc.nextInt();
            if (tl[i] <= t && nl[i] < max) {
                max = nl[i];
            }
        } {
            nl[i] = sc.nextInt();
            tl[i] = sc.nextInt();
            if (tl[i] <= t && nl[i] < max) {
                max = nl[i];
            }
        } nl[i] = sc.nextInt() nl[i] nl i sc.nextInt() sc.nextInt sc tl[i] = sc.nextInt() tl[i] tl i sc.nextInt() sc.nextInt sc if (tl[i] <= t && nl[i] < max) {
                max = nl[i];
            } tl[i] <= t && nl[i] < max tl[i] <= t tl[i] tl i t nl[i] < max nl[i] nl i max {
                max = nl[i];
            } max = nl[i] max nl[i] nl i if (max == Integer.MAX_VALUE) {
            System.out.println("TLE");
        } else {
            System.out.println(max);
        } max == Integer.MAX_VALUE max Integer.MAX_VALUE Integer Integer.MAX_VALUE {
            System.out.println("TLE");
        } System.out.println("TLE") System.out.println System.out System System.out "TLE" {
            System.out.println(max);
        } System.out.println(max) System.out.println System.out System System.out max String[] args args 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);
        }

    }
} 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);
        }

    }
} Main
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);
        }

    }
}