import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int T = sc.nextInt();
		int[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(minCost);
	}
} import java.util.Scanner; Scanner 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[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(minCost);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int T = sc.nextInt();
		int[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(minCost);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int T = sc.nextInt();
		int[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(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[][] route = new int[N][2]; route new int[N][2] N 2 for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < N i N ++i ++i i {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		} {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		} route[i][0] = sc.nextInt() route[i][0] route[i] route i 0 sc.nextInt() sc.nextInt sc route[i][1] = sc.nextInt() route[i][1] route[i] route i 1 sc.nextInt() sc.nextInt sc sc.close() sc.close sc int minCost = Integer.MAX_VALUE; minCost Integer.MAX_VALUE Integer Integer.MAX_VALUE for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0]; int i = 0; int i = 0; i 0 i < N i N ++i ++i i if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0]; if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0]; route[i][1] <= T && route[i][0] < minCost route[i][1] <= T route[i][1] route[i] route i 1 T route[i][0] < minCost route[i][0] route[i] route i 0 minCost minCost = route[i][0] minCost route[i][0] route[i] route i 0 if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(minCost); minCost == Integer.MAX_VALUE minCost Integer.MAX_VALUE Integer Integer.MAX_VALUE System.out.println("TLE") System.out.println System.out System System.out "TLE" System.out.println(minCost) System.out.println System.out System System.out 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[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(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[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(minCost);
	}
} Main
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int T = sc.nextInt();
		int[][] route = new int[N][2];
		for(int i = 0;i < N;++i) {
			route[i][0] = sc.nextInt();
			route[i][1] = sc.nextInt();
		}
		sc.close();
		
		int minCost = Integer.MAX_VALUE;
		for(int i = 0;i < N;++i)
			if(route[i][1] <= T && route[i][0] < minCost)
				minCost = route[i][0];
		
		if(minCost == Integer.MAX_VALUE)
			System.out.println("TLE");
		else
			System.out.println(minCost);
	}
}
