Polyclinic — Eolymp

Input

The first line contains three numbers: the number of patients $n$ , the session start time $t_{1}$ t_1, and the session end time $t_{2}$ t_2, where $t_{2}$ t_2 is greater than $t_{1}$ t_1.

The second line provides $n$ numbers $a_{1}, a_{2}, \dots, a_{n}$ a_1, a_2, \ldots, a_n - the arrival times of the first, second, ..., $n$ -th patient at the clinic. These numbers are distinct and sorted in ascending order.

The third line contains $n$ numbers $b_{1}, b_{2}, \dots, b_{n}$ b_1, b_2, \ldots, b_n - the examination durations for the first, second, ..., $n$ -th patient.

All input numbers are natural numbers. The number of patients $n$ does not exceed $1 0^{5}$ 10^5, and the other numbers do not exceed $1 0^{9}$ 10^9.

On Petryk Pyatochkin's planet, a day is significantly longer than on Earth, so the start time $t_{1}$ t_1, end time $t_{2}$ t_2, as well as the numbers $a_{1}, a_{2}, \dots, a_{n}$ a_1, a_2, \ldots, a_n and $b_{1}, b_{2}, \dots, b_{n}$ b_1, b_2, \ldots, b_n can exceed $1440$ - the number of minutes in an Earth day.

Output

Output a single natural number - the earliest time Petryk Pyatochkin should arrive at the clinic to ensure he sees the doctor that day with minimal waiting. If Petryk arrives at the same time as another patient, he will be seen first because he is younger.

Examples

Example 1

Loading

Example 2

Loading

Example 3

Loading

Example 4

Loading