Contest Duration: - (local time) (100 minutes) Back to Home
B - Time Limit Exceeded /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

スマートウォッチであるあなたは、N 個の帰宅経路を見つけました。

X さんが i 番目の経路を使う場合、コスト c_i かけて時間 t_i で帰宅できます。

### 制約

• 入力はすべて整数である
• 1 \leq N \leq 100
• 1 \leq T \leq 1000
• 1 \leq c_i \leq 1000
• 1 \leq t_i \leq 1000
• (c_i, t_i) の組は異なる

### 入力

N T
c_1 t_1
c_2 t_2
:
c_N t_N


### 出力

ただし、どの経路を使っても時間 T 以内に帰宅できない場合、TLE と出力せよ。

### 入力例 1

3 70
7 60
1 80
4 50


### 出力例 1

4

• 1 番目の経路を使うと、コスト 7 で帰宅できます
• 2 番目の経路では時間 T = 70 以内に帰宅できません
• 3 番目の経路を使うと、コスト 4 で帰宅できます

### 入力例 2

4 3
1 1000
2 4
3 1000
4 500


### 出力例 2

TLE


どの経路を使っても時間 T = 3 以内に帰宅できません。

### 入力例 3

5 9
25 8
5 9
4 10
1000 1000
6 1


### 出力例 3

5


Score : 200 points

### Problem Statement

When Mr. X is away from home, he has decided to use his smartwatch to search the best route to go back home, to participate in ABC.

You, the smartwatch, has found N routes to his home.

If Mr. X uses the i-th of these routes, he will get home in time t_i at cost c_i.

Find the smallest cost of a route that takes not longer than time T.

### Constraints

• All values in input are integers.
• 1 \leq N \leq 100
• 1 \leq T \leq 1000
• 1 \leq c_i \leq 1000
• 1 \leq t_i \leq 1000
• The pairs (c_i, t_i) are distinct.

### Input

Input is given from Standard Input in the following format:

N T
c_1 t_1
c_2 t_2
:
c_N t_N


### Output

Print the smallest cost of a route that takes not longer than time T.

If there is no route that takes not longer than time T, print TLE instead.

### Sample Input 1

3 70
7 60
1 80
4 50


### Sample Output 1

4

• The first route gets him home at cost 7.
• The second route takes longer than time T = 70.
• The third route gets him home at cost 4.

Thus, the cost 4 of the third route is the minimum.

### Sample Input 2

4 3
1 1000
2 4
3 1000
4 500


### Sample Output 2

TLE


There is no route that takes not longer than time T = 3.

### Sample Input 3

5 9
25 8
5 9
4 10
1000 1000
6 1


### Sample Output 3

5