Today, Chef woke up to find that he had no clean socks. Doing laundry is such a turn-off for Chef, that in such a situation, he always buys new socks instead of cleaning the old dirty ones. He arrived at the fashion store with money rupees in his pocket and started looking for socks. Everything looked good, but then Chef saw a new jacket which cost jacketCost rupees. The jacket was so nice that he could not stop himself from buying it.

Interestingly, the shop only stocks one kind of socks, enabling them to take the unsual route of selling single socks, instead of the more common way of selling in pairs. Each of the socks costs sockCost rupees.

Chef bought as many socks as he could with his remaining money. It's guaranteed that the shop has more socks than Chef can buy. But now, he is interested in the question: will there be a day when he will have only 1 clean sock, if he uses a pair of socks each day starting tommorow? If such an unlucky day exists, output "Unlucky Chef", otherwise output "Lucky Chef". Remember that Chef never cleans or reuses any socks used once.

-----Input-----
The first line of input contains three integers — jacketCost, sockCost, money — denoting the cost of a jacket, cost of a single sock, and the initial amount of money Chef has, respectively.

-----Output-----
In a single line, output "Unlucky Chef" if such a day exists. Otherwise, output "Lucky Chef". 

-----Constraints-----
- 1 ≤ jacketCost ≤ money ≤ 109
- 1 ≤ sockCost ≤ 109

-----Example-----
Input:
1 2 3

Output:
Unlucky Chef

Input:
1 2 6

Output:
Lucky Chef

-----Subtasks-----
- Subtask 1:  jacketCost, money, sockCost ≤ 103. Points - 20
- Subtask 2: Original constraints. Points - 80

-----Explanation-----
Test #1:
When Chef arrived at the shop, he had 3 rupees. After buying the jacket, he has 2 rupees left, enough to buy only 1 sock.
Test #2:
Chef had 6 rupees in the beginning. After buying the jacket, he has 5 rupees left, enough to buy a pair of socks for 4 rupees.

Difficulty: EASY
Tags: Mathematics

Implementation

Starter code:

Solutions:
(x, y, z) = map(int, input().split())
t = (z - x) // y
if t % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(jacketCost, sockCost, money) = map(int, input().split())
ans = (money - jacketCost) // sockCost
if ans % 2 != 0:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


(j, s, m) = map(int, input().split())
k = m - j
if k // s % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


import math
(J, S, M) = map(int, input().split(' '))
M = M - J
if math.floor(M // S) % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(j, s, m) = map(int, input().split())
r = m - j
if r <= 0:
	print('Unlucky Chef')
else:
	res = int(r / s)
	if res >= 2:
		if res % 2 == 0:
			print('Lucky Chef')
		else:
			print('Unlucky Chef')
	else:
		print('Unlucky Chef')


(a, b, c) = map(int, input().split())
c = c - a
if c // b % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(jacketCost, sockCost, money) = map(int, input().split())
remaining_money = money - jacketCost
no_of_socks = remaining_money // sockCost
print('Unlucky Chef' if no_of_socks % 2 == 1 else 'Lucky Chef')


(jacketCost, sockCost, money) = map(int, input().split())
x = (money - jacketCost) // sockCost
if x == 0:
	print('Unlucky Chef')
elif x % 2 == 1:
	print('Unlucky  Chef')
else:
	print('Lucky Chef')


(jc, sc, m) = map(int, input().split())
n = (m - jc) // sc
if n % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


try:

	def socks():
		(jacket, sock, money) = map(int, input().split())
		rem = money - jacket
		a = rem // sock
		if a % 2 == 0:
			print('Lucky Chef')
		else:
			print('Unlucky Chef')
	socks()
except:
	pass


(A, B, C) = map(int, input().split())
if (C - A) // B % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


lis = list(map(int, input().split()))
jacket = lis[0]
sock = lis[1]
money = lis[2] - jacket
if money % (sock * 2) < sock:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


from sys import stdin
try:
	(jacket, sock, money) = [int(x) for x in stdin.readline().split()]
	if (money - jacket) // sock % 2 == 0:
		print('Lucky Chef')
	else:
		print('Unlucky Chef')
except:
	pass


(jacket, socks, money) = map(int, input().split(' '))
remaining = money - jacket
if remaining // socks % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(jc, sc, m) = (int(i) for i in input().split())
if (m - jc) // sc % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(jacket, sock, intial) = map(int, input().split())
money = intial - jacket
count = money // sock
if count % 2 != 0:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


def solve():
	rem = money - j_cost
	sock = rem // s_cost
	if sock % 2 == 0:
		return 'Lucky Chef'
	else:
		return 'Unlucky Chef'
(j_cost, s_cost, money) = map(int, input().split())
print(solve())


(x, y, z) = map(int, input().split())
if z - x > 0:
	c = z - x
	d = c // y
	if d % 2 == 0:
		print('Lucky Chef')
	else:
		print('Unlucky Chef')
else:
	print('Unlucky Chef')


(jacketCost, sockCost, money) = list(map(int, input().split()))
remainingMoney = money - jacketCost
PairOfsocks = remainingMoney // sockCost
if PairOfsocks % 2 == 1:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


import sys
(life, wife, aim) = map(int, sys.stdin.readline().split())
sys.stdout.write('Lucky Chef\n' if (aim - life) // wife % 2 == 0 else 'Unlucky Chef\n')


(jacketcost, sockcost, money) = map(int, input().split())
left_money = money - jacketcost
sock = left_money // sockcost
print('Lucky Chef') if sock % 2 == 0 else print('Unlucky Chef')


(J, S, M) = map(int, input().split())
M -= J
count = M // S
print('Unlucky Chef') if count % 2 else print('Lucky Chef')


a = [int(x) for x in input().split()]
x = a[2] - a[0]
x = x // a[1]
if x % 2 != 0:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


(jC, sC, m) = map(int, input().split())
print('Lucky Chef' if (m - jC) // sC % 2 == 0 else 'Unlucky Chef')


(j, s, m) = map(int, input().split())
rem = m - j
n = rem // s
if n % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(jc, sc, m) = map(int, input().split())
d = m - jc
if d // sc % 2 == 1:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


(j, s, m) = map(int, input().split())
m = m - j
if m >= 2 * s:
	m = m % (2 * s)
	if m >= s:
		print('Unlucky Chef')
	else:
		print('Lucky Chef')
elif m >= s:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


from sys import stdin, stdout

def sin():
	return stdin.readline()

def out(s):
	stdout.write(str(s) + '\n')
(a, b, c) = map(int, sin().split(' '))
if (c - a) // b % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(a, b, c) = map(int, input().split())
x = c - a
if x // b % 2 == 1:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


(J, S, M) = (int(item) for item in input().split())
moneyLeft = M - J
noOfSocks = moneyLeft // S
if noOfSocks % 2 != 0:
	print('Unlucky Chef')
else:
	print('Lucky Chef')


(jacketCost, sockCost, money) = map(int, input().split())
remainin_money = money - jacketCost
number_of_socks = remainin_money // sockCost
if number_of_socks % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(i, j, k) = map(int, input().split())
k -= i
val = k // j
if val % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(JC, SC, M) = map(int, input().split())
if (M - JC) // SC % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


import sys
(j, s, m) = map(int, sys.stdin.readline().split())
sys.stdout.write('Lucky Chef\n' if (m - j) // s % 2 == 0 else 'Unlucky Chef\n')


(jc, sc, money) = map(int, input().split())
money -= jc
if money // sc % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


try:
	(j, s, m) = map(int, input().split())
	m = m - j
	b = m // s
	if b % 2 == 0:
		print('Lucky Chef')
	else:
		print('Unlucky Chef')
except:
	pass


x = input().split()
l = []
for i in x:
	i = int(i)
	l.append(i)
c = l[2]
c = c - l[0]
c = c // l[1]
c = int(c)
if c % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(jacketCost, sockCost, money) = [int(x) for x in input().split()]
print('Unlucky Chef') if (money - jacketCost) // sockCost % 2 else print('Lucky Chef')


(J, S, M) = [int(x) for x in input('').split()]
N = M - J
Y = N // S
if Y % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')


(n1, n2, n3) = map(int, input().split())
if (n3 - n1) // n2 % 2 == 0:
	print('Lucky Chef')
else:
	print('Unlucky Chef')