import java.util.Scanner;
import java.util.HashMap;

public class Main {

  public static void main(String[] args) {

    Scanner sc = new Scanner(System.in);

    int N = sc.nextInt();
    int T = sc.nextInt();
    int minCost = 0;

    for (int i = 0; i < N; i++) {

      int c1 = sc.nextInt();
      int t1 = sc.nextInt();

      if (t1 <= T) {
        if (minCost == 0 || c1 < minCost) {
          minCost = c1;
        }
      }
    }
    
    System.out.println(minCost == 0 ? "TLE" : minCost);
  }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz