import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int t = sc.nextInt();
        int ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    }
} import java.util.Scanner; Scanner java.util import java.util.TreeMap; TreeMap 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 ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int t = sc.nextInt();
        int ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int t = sc.nextInt();
        int ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    } 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 ans = Integer.MAX_VALUE; ans Integer.MAX_VALUE Integer Integer.MAX_VALUE TreeMap<Integer, Integer> map = new TreeMap<>(); map new TreeMap<>() for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        } {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        } int key = sc.nextInt(); key sc.nextInt() sc.nextInt sc int val = sc.nextInt(); val sc.nextInt() sc.nextInt sc if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            } val <= t val t {
                map.put(key, val);
                ans = Math.min(ans, key);
            } map.put(key, val) map.put map key val ans = Math.min(ans, key) ans Math.min(ans, key) Math.min Math ans key if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        } map.size() == 0 map.size() map.size map 0 {
            System.out.println("TLE");
        } System.out.println("TLE") System.out.println System.out System System.out "TLE" {
            System.out.println(ans);
        } System.out.println(ans) System.out.println System.out System System.out ans 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 ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int t = sc.nextInt();
        int ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    }
} Main
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int t = sc.nextInt();
        int ans = Integer.MAX_VALUE;
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int i = 0; i < n; i++) {
            int key = sc.nextInt();
            int val = sc.nextInt();
            if(val <= t) {
                map.put(key, val);
                ans = Math.min(ans, key);
            }
        }
        if(map.size() == 0) {
            System.out.println("TLE");
        } else {
            System.out.println(ans);
        }
    }
}