F. lzd is a scout
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Recently, lzd love play Battlefield 1, he especially likes to play scouts. In the game he is a shooter and can snipe any opponent he sees. But there is an interval feature called damage drop in the game, which means that if the distance between enemy and him is in this interval, lzd only needs to shoot it once to kill it, otherwise he needs an extra shot to make up for the damage. For example, now lzd has a Gewehr 98, and its damage range is $$$[80, 125]$$$, so all enemies whose distence is within this range can be killed with just one shot.

Today, lzd is trapped on the top of the mountain by $$$n$$$ enemies. But he only has a homemade rifle with $$$m$$$ bullets while the rifle's damage drop is $$$[l,r]$$$. You have known all the distance between he and enemies. Please tell him whether he can finish all the kill or not.

Input

The input contain two lines.

The first line contains four intergers $$$n,\ m,\ l,\ r\ (1 \leq n \leq 1,000,000;\ 1 \leq m \leq 1,000,000,000;\ 1 \leq l \leq r \leq 1,000,000,000)$$$, representing there are $$$n$$$ enemies and $$$m$$$ bullets with the damage dorp $$$[l,r]$$$ of lzd's rifle.

The second line contains $$$m$$$ intergers, the $$$i$$$-th interger $$$d_i\ (1 \leq d_i \leq 1,000,000,000)$$$ representing the distence between the $$$i$$$-th enemy and him.

Output

Print a line with lzdak! if lzd can finish the all kill, otherwise print a integer representing the number of enemies he can kill

Example
Input
2 3 5 10
3 10
Output
lzdak!