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 a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  }
} 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 a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  }
} Main public  static void main(String[] args){
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int t = sc.nextInt();
    int a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  } main {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int t = sc.nextInt();
    int a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  } 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 a ; a int b ; b TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>(); map new TreeMap<Integer,Integer>() for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    } int i=0; int i=0; i 0 i<n i n i++ i++ i {
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    } {
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    } a = sc.nextInt() a sc.nextInt() sc.nextInt sc b = sc.nextInt() b sc.nextInt() sc.nextInt sc if(b<=t){
       map.put(a,b);
     } b<=t b t {
       map.put(a,b);
     } map.put(a,b) map.put map a b if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    } 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(map.firstKey());
    } System.out.println(map.firstKey()) System.out.println System.out System System.out map.firstKey() map.firstKey map 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 a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  }
} public class Main{
  public  static void main(String[] args){
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int t = sc.nextInt();
    int a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  }
} 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 a ;
    int b ;
    TreeMap<Integer,Integer> map = new TreeMap<Integer,Integer>();
    for(int i=0; i<n; i++){
     a = sc.nextInt();
     b = sc.nextInt();
     if(b<=t){
       map.put(a,b);
     }
    }
    if(map.size()==0){
      System.out.println("TLE");
    }else{
      System.out.println(map.firstKey());
    }

  }
}
