Limak and Radewoosh are going to compete against each other in the upcoming algorithmic contest. They are equally skilled but they won't solve problems in the same order.

There will be n problems. The i-th problem has initial score p_{i} and it takes exactly t_{i} minutes to solve it. Problems are sorted by difficulty — it's guaranteed that p_{i} < p_{i} + 1 and t_{i} < t_{i} + 1.

A constant c is given too, representing the speed of loosing points. Then, submitting the i-th problem at time x (x minutes after the start of the contest) gives max(0,  p_{i} - c·x) points.

Limak is going to solve problems in order 1, 2, ..., n (sorted increasingly by p_{i}). Radewoosh is going to solve them in order n, n - 1, ..., 1 (sorted decreasingly by p_{i}). Your task is to predict the outcome — print the name of the winner (person who gets more points at the end) or a word "Tie" in case of a tie.

You may assume that the duration of the competition is greater or equal than the sum of all t_{i}. That means both Limak and Radewoosh will accept all n problems.


-----Input-----

The first line contains two integers n and c (1 ≤ n ≤ 50, 1 ≤ c ≤ 1000) — the number of problems and the constant representing the speed of loosing points.

The second line contains n integers p_1, p_2, ..., p_{n} (1 ≤ p_{i} ≤ 1000, p_{i} < p_{i} + 1) — initial scores.

The third line contains n integers t_1, t_2, ..., t_{n} (1 ≤ t_{i} ≤ 1000, t_{i} < t_{i} + 1) where t_{i} denotes the number of minutes one needs to solve the i-th problem.


-----Output-----

Print "Limak" (without quotes) if Limak will get more points in total. Print "Radewoosh" (without quotes) if Radewoosh will get more points in total. Print "Tie" (without quotes) if Limak and Radewoosh will get the same total number of points.


-----Examples-----
Input
3 2
50 85 250
10 15 25

Output
Limak

Input
3 6
50 85 250
10 15 25

Output
Radewoosh

Input
8 1
10 20 30 40 50 60 70 80
8 10 58 63 71 72 75 76

Output
Tie



-----Note-----

In the first sample, there are 3 problems. Limak solves them as follows:

  Limak spends 10 minutes on the 1-st problem and he gets 50 - c·10 = 50 - 2·10 = 30 points.  Limak spends 15 minutes on the 2-nd problem so he submits it 10 + 15 = 25 minutes after the start of the contest. For the 2-nd problem he gets 85 - 2·25 = 35 points.  He spends 25 minutes on the 3-rd problem so he submits it 10 + 15 + 25 = 50 minutes after the start. For this problem he gets 250 - 2·50 = 150 points. 

So, Limak got 30 + 35 + 150 = 215 points.

Radewoosh solves problem in the reversed order:

  Radewoosh solves 3-rd problem after 25 minutes so he gets 250 - 2·25 = 200 points.  He spends 15 minutes on the 2-nd problem so he submits it 25 + 15 = 40 minutes after the start. He gets 85 - 2·40 = 5 points for this problem.  He spends 10 minutes on the 1-st problem so he submits it 25 + 15 + 10 = 50 minutes after the start. He gets max(0, 50 - 2·50) = max(0,  - 50) = 0 points. 

Radewoosh got 200 + 5 + 0 = 205 points in total. Limak has 215 points so Limak wins.

In the second sample, Limak will get 0 points for each problem and Radewoosh will first solve the hardest problem and he will get 250 - 6·25 = 100 points for that. Radewoosh will get 0 points for other two problems but he is the winner anyway.

In the third sample, Limak will get 2 points for the 1-st problem and 2 points for the 2-nd problem. Radewoosh will get 4 points for the 8-th problem. They won't get points for other problems and thus there is a tie because 2 + 2 = 4.

Difficulty: EASY

Solutions:
(n, c) = map(int, input().split())
problems = list(map(int, input().split()))
time = list(map(int, input().split()))
(lmk, rdw) = (0, 0)
total_time_1 = 0
total_time_2 = sum(time)
for i in range(n):
	total_time_1 += time[i]
	lmk += max(0, problems[i] - c * total_time_1)
	rdw += max(0, problems[i] - c * total_time_2)
	total_time_2 -= time[i]
if lmk > rdw:
	print('Limak')
elif rdw > lmk:
	print('Radewoosh')
else:
	print('Tie')


def competition_winner(points, times, c):
	limak_points = 0
	rage_points = 0
	for i in range(len(points)):
		limak_points += max(0, points[i] - c * sum(times[0:i + 1]))
		rage_points += max(0, points[len(points) - i - 1] - c * sum(times[len(points) - i - 1:len(points)]))
	if limak_points > rage_points:
		print('Limak')
	elif rage_points > limak_points:
		print('Radewoosh')
	else:
		print('Tie')
(n, c) = map(int, input().split())
points = list(map(int, input().split()))
times = list(map(int, input().split()))
competition_winner(points, times, c)


def s():
	(n, c) = [int(x) for x in input().split(' ')]
	p = [int(x) for x in input().split(' ')]
	t = [int(x) for x in input().split(' ')]
	limak_score = 0
	rad_score = 0
	limak_elapsed_time = 0
	rad_elapsed_time = 0
	for i in range(n):
		limak_score += max(0, p[i] - c * (limak_elapsed_time + t[i]))
		limak_elapsed_time += t[i]
		rad_score += max(0, p[n - 1 - i] - c * (rad_elapsed_time + t[n - 1 - i]))
		rad_elapsed_time += t[n - 1 - i]
	if limak_score > rad_score:
		print('Limak')
	elif rad_score > limak_score:
		print('Radewoosh')
	else:
		print('Tie')
s()


(m, n) = map(int, input().split())
line1 = [int(nhap1) for nhap1 in input().split()]
line2 = [int(nhap2) for nhap2 in input().split()]
(Limak, Rade) = (0, 0)
(add, radd) = (0, 0)
for i in range(m):
	add = add + line2[i]
	radd = radd + line2[m - 1 - i]
	a = line1[i] - n * add
	b = line1[m - 1 - i] - n * radd
	if a < 0:
		a = 0
	if b < 0:
		b = 0
	Limak = Limak + a
	Rade = Rade + b
if Limak > Rade:
	print('Limak')
elif Limak < Rade:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak = 0
rode = 0
currtime = 0
for i in range(n):
	currtime += t[i]
	limak += max(0, p[i] - c * currtime)
i = n - 1
currtime = 0
while i >= 0:
	currtime += t[i]
	rode += max(0, p[i] - c * currtime)
	i -= 1
if limak > rode:
	print('Limak')
elif rode > limak:
	print('Radewoosh')
else:
	print('Tie')


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
l1 = list(map(int, input().split()))
k = 0
m1 = 0
k1 = 0
for i in range(n):
	m1 += l1[i]
	k += max(0, l[i] - m1 * m)
m1 = 0
for i in range(n - 1, -1, -1):
	m1 += l1[i]
	k1 += max(0, l[i] - m1 * m)
if k > k1:
	print('Limak')
elif k < k1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak = 0
rade = 0
time = 0
for i in range(n):
	time += t[i]
	limak += max(0, p[i] - c * time)
time = 0
for i in range(n - 1, -1, -1):
	time += t[i]
	rade += max(0, p[i] - c * time)
if limak > rade:
	print('Limak')
elif limak == rade:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
m = [int(i) for i in input().split()]
(lim, ran) = (0, 0)
(tl, tr) = (0, 0)
for i in range(n):
	tl += m[i]
	tr += m[n - 1 - i]
	lim += max(0, p[i] - c * tl)
	ran += max(0, p[n - 1 - i] - c * tr)
if lim > ran:
	print('Limak')
elif ran > lim:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(tmp) for tmp in input().split()]
p = [int(tmp) for tmp in input().split()]
t = [int(tmp) for tmp in input().split()]
limak = 0
radewoosh = 0
timel = 0
timer = 0
for i in range(n):
	cekl = 0
	cekr = 0
	timel += t[i]
	timer += t[n - i - 1]
	cekl = max(cekl, p[i] - timel * c)
	cekr = max(cekr, p[n - i - 1] - timer * c)
	limak += cekl
	radewoosh += cekr
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
elif limak == radewoosh:
	print('Tie')


(m, c) = list(map(int, input().split()))
p = list(map(int, input().split()))
n = list(map(int, input().split()))
(sum1, sum2, sm) = (0, 0, 0)
for i in range(m):
	sm += n[i]
	sum1 = sum1 + max(0, p[i] - c * sm)
sm = 0
i = m - 1
while i >= 0:
	sm += n[i]
	sum2 = sum2 + max(0, p[i] - c * sm)
	i -= 1
if sum1 > sum2:
	print('Limak')
elif sum2 > sum1:
	print('Radewoosh')
elif sum1 == sum2:
	print('Tie')


(n, c) = tuple(map(int, input().split()))
l = tuple(map(int, input().split()))
r = tuple(map(int, input().split()))
time = 0
b_l = 0
b_r = 0
for i in range(n):
	time += r[i]
	b_l += max(0, l[i] - time * c)
time = 0
for i in range(n - 1, -1, -1):
	time += r[i]
	b_r += max(0, l[i] - time * c)
if b_l > b_r:
	print('Limak')
elif b_l == b_r:
	print('Tie')
else:
	print('Radewoosh')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s1 = 0
s2 = 0
c = 0
d = 0
for i in range(n):
	c = c + b[i]
	s1 = s1 + max(0, a[i] - c * k)
	d = d + b[n - i - 1]
	s2 = s2 + max(0, a[n - i - 1] - d * k)
if s1 > s2:
	print('Limak')
elif s2 > s1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = (int(i) for i in input().split())
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
sl = 0
sr = 0
tt = 0
for i in range(n):
	tt += t[i]
	s = p[i] - tt * c
	if s > 0:
		sl += s
tt = 0
for i in range(n - 1, -1, -1):
	tt += t[i]
	s = p[i] - tt * c
	if s > 0:
		sr += s
if sl > sr:
	print('Limak')
elif sr > sl:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c1 = 0
c2 = 0
time = 0
for i in range(len(a)):
	time += b[i]
	c1 += max(0, a[i] - c * time)
time = 0
for i in range(len(a) - 1, -1, -1):
	time += b[i]
	c2 += max(0, a[i] - c * time)
if c1 > c2:
	print('Limak')
elif c2 > c1:
	print('Radewoosh')
else:
	print('Tie')


from sys import stdin, stdout, exit as sys_ret
(f_input, f_print, f_flush) = (stdin.readline, stdout.write, stdout.flush)
(tasks, mult) = map(int, f_input().split())
task_value = [int(_) for _ in f_input().split()]
task_time = [int(_) for _ in f_input().split()]
(Limak, Radewoosh, t1, t2) = (0, 0, 0, 0)
for i in range(tasks):
	t1 += task_time[i]
	t2 += task_time[tasks - i - 1]
	Limak += max(0, task_value[i] - mult * t1)
	Radewoosh += max(0, task_value[tasks - i - 1] - mult * t2)
if Limak > Radewoosh:
	f_print('Limak')
elif Radewoosh > Limak:
	f_print('Radewoosh')
else:
	f_print('Tie')


(n, c) = list(map(int, input().strip().split()))
l = list(map(int, input().strip().split()))
t = list(map(int, input().strip().split()))
k = 0
p = 0
for i in range(n):
	j = l[i] - c * sum(t[:i + 1])
	if j < 0:
		k += 0
	else:
		k += j
l = l[::-1]
t = t[::-1]
for i in range(n):
	j = l[i] - c * sum(t[:i + 1])
	if j < 0:
		p += 0
	else:
		p += j
if k > p:
	print('Limak')
elif p > k:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
scores = list(map(int, input().split()))
time = list(map(int, input().split()))
(l, r, t_l, t_r) = (0, 0, 0, 0)
for i in range(n):
	t_l += time[i]
	l += max(0, scores[i] - c * t_l)
for j in reversed(range(n)):
	t_r += time[j]
	r += max(0, scores[j] - c * t_r)
if l < r:
	print('Radewoosh')
if l > r:
	print('Limak')
if l == r:
	print('Tie')


(_, a) = map(int, input().split())
e = 0
f = 0
(c, d) = (list(map(int, input().split())), list(map(int, input().split())))
for i in range(_):
	e = e + max(0, c[i] - a * sum(d[0:i + 1]))
	f = f + max(0, c[-1 - i] - a * (sum(d[-1 - i:-1]) + d[-1]))
print('Limak' if e > f else 'Radewoosh' if e < f else 'Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
x = 0
ansl = 0
for i in range(n):
	x += t[i]
	ansl += max(0, p[i] - c * x)
x = 0
ansr = 0
for i in range(n - 1, -1, -1):
	x += t[i]
	ansr += max(0, p[i] - c * x)
if ansl > ansr:
	print('Limak')
elif ansl == ansr:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
(l, r, time) = (0, 0, 0)
for i in range(len(p)):
	time += t[i]
	l += max(0, p[i] - c * time)
time = 0
for i in range(len(p) - 1, -1, -1):
	time += t[i]
	r += max(0, p[i] - c * time)
if r > l:
	print('Radewoosh')
elif l > r:
	print('Limak')
else:
	print('Tie')


q = lambda : map(int, input().split())
qi = lambda : int(input())
qs = lambda : input().split()
(n, m) = q()
p = list(q())
t = list(q())
(c1, c2) = (0, 0)
for i in range(n):
	c1 += max(0, p[i] - m * sum(t[:i + 1]))
	c2 += max(0, p[-(i + 1)] - m * sum(t[::-1][:i + 1]))
print('Limak' if c1 > c2 else 'Radewoosh' if c2 > c1 else 'Tie')


(n, c) = [int(s) for s in input().split(' ')]
p = [int(s) for s in input().split(' ')]
t = [int(s) for s in input().split(' ')]
limak = sum([max(p[i] - c * sum(t[:i + 1]), 0) for i in range(n)])
radewoosh = sum([max(p[::-1][i] - c * sum(t[::-1][:i + 1]), 0) for i in range(n)])
if limak > radewoosh:
	print('Limak')
elif limak == radewoosh:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
(su1, su2) = (0, 0)
time = 0
for i in range(n):
	time += ar2[i]
	su1 += max(0, ar1[i] - int(c * time))
time = 0
for i in range(n - 1, -1, -1):
	time += ar2[i]
	su2 += max(0, ar1[i] - int(c * time))
if su1 > su2:
	print('Limak')
if su1 < su2:
	print('Radewoosh')
if su1 == su2:
	print('Tie')


I = lambda : list(map(int, input().split()))
(n, c) = I()
P = I()
T = I()
k = 0
q = 0
for (p, t) in zip(P, T):
	q += t
	k += max(0, p - c * q)
q = 0
for (p, t) in zip(P[::-1], T[::-1]):
	q += t
	k -= max(0, p - c * q)
print('Limak' if k > 0 else ['Tie', 'Radewoosh'][k < 0])


(n, c) = map(int, input().split())
a = list(map(int, input().split()))
t = list(map(int, input().split()))
sum1 = 0
sum2 = 0
z = 0
x = 0
for i in range(n):
	z += t[i]
	x += t[n - i - 1]
	sum2 += max(0, a[n - i - 1] - c * x)
	sum1 += max(0, a[i] - c * z)
if sum1 > sum2:
	print('Limak')
if sum1 < sum2:
	print('Radewoosh')
if sum1 == sum2:
	print('Tie')


(a, b) = map(int, input().split())
n = list(map(int, input().split()))
m = list(map(int, input().split()))
(l, y) = ([], [])
(x, q, w, o) = (0, 0, 0, 0)
for e in m:
	x = x + e
	l.append(x)
for i in range(len(l)):
	q = q + max(0, n[i] - b * l[i])
n = n[::-1]
m = m[::-1]
for p in m:
	w = w + p
	y.append(w)
for r in range(len(y)):
	o = o + max(0, n[r] - b * y[r])
if q > o:
	print('Limak')
elif q == o:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
scores = list(map(int, input().split()))
times = list(map(int, input().split()))
(score_1, score_2) = (0, 0)
x = 0
for i in range(0, n):
	x += times[i]
	score_1 += max(0, scores[i] - x * c)
x = 0
for i in range(n - 1, -1, -1):
	x += times[i]
	score_2 += max(0, scores[i] - x * c)
if score_1 > score_2:
	print('Limak')
elif score_1 == score_2:
	print('Tie')
else:
	print('Radewoosh')


II = lambda : map(int, input().split())
(n, c) = II()
Ps = list(II())
Ts = list(II())
from itertools import accumulate
L = sum((max(0, p - c * x) for (x, p) in zip(accumulate(Ts), Ps)))
R = sum((max(0, p - c * x) for (x, p) in zip(accumulate(reversed(Ts)), reversed(Ps))))
print(('Tie', 'Limak', 'Radewoosh')[(L > R) + (L < R) * 2])


(n, x) = map(int, input().split())
l1 = list(map(int, input().split()))
r1 = list(map(int, input().split()))
l2 = l1[::-1]
r2 = r1[::-1]
s1 = s2 = v1 = v2 = 0
for i in range(n):
	v1 += r1[i]
	s1 += max(0, l1[i] - x * v1)
	v2 += r2[i]
	s2 += max(0, l2[i] - x * v2)
if s1 > s2:
	print('Limak')
elif s2 > s1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
(p, t) = (list(map(int, input().split())), list(map(int, input().split())))
(l, r, a) = (0, 0, 0)
for x in range(n):
	l += max(0, p[x] - c * (a + t[x]))
	a += t[x]
a = 0
for y in range(n - 1, -1, -1):
	r += max(0, p[y] - c * (a + t[y]))
	a += t[x]
print('Tie' if l == r else ['Limak', 'Radewoosh'][l < r])


(n, m) = list(map(int, input().split()))
p = list(map(int, input().split()))
o = list(map(int, input().split()))
A = 0
for i in range(n):
	A += max(0, p[i] - m * sum(o[0:i + 1]))
B = 0
for i in range(n - 1, -1, -1):
	B += max(0, p[i] - m * sum(o[i:n]))
if A > B:
	print('Limak')
elif A < B:
	print('Radewoosh')
elif A == B:
	print('Tie')


(n, c) = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s1 = 0
s2 = 0
t1 = 0
t2 = 0
for i in range(n):
	t1 = t1 + b[i]
	if a[i] - c * t1 > 0:
		s1 = s1 + a[i] - c * t1
	t2 = t2 + b[n - 1 - i]
	if a[n - 1 - i] - c * t2 > 0:
		s2 = s2 + a[n - 1 - i] - c * t2
if s1 > s2:
	print('Limak')
elif s1 < s2:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak = 0
radewoosh = 0
x = 0
y = 0
length = len(p)
for i in range(length):
	x += t[i]
	y += t[length - i - 1]
	limak += max(0, p[i] - c * x)
	radewoosh += max(0, p[length - i - 1] - c * y)
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l = list(map(int, input().split()))
t = list(map(int, input().split()))
(s, p) = (0, 0)
for i in range(n):
	r = l[i] - c * sum(t[:i + 1])
	s += max(0, r)
t = t[::-1]
l = l[::-1]
for i in range(n):
	q = l[i] - c * sum(t[:i + 1])
	p += max(0, q)
if s > p:
	print('Limak')
elif p > s:
	print('Radewoosh')
else:
	print('Tie')


temp = input().strip().split()
n = int(temp[0])
c = int(temp[1])
pVals = input().strip().split()
tVals = input().strip().split()
pVals = [int(stng) for stng in pVals]
tVals = [int(stng) for stng in tVals]
l = 0
mins = 0
for i in range(n):
	mins = mins + tVals[i]
	l = l + max(0, pVals[i] - c * mins)
r = 0
mins = 0
for i in range(n - 1, -1, -1):
	mins = mins + tVals[i]
	r = r + max(0, pVals[i] - c * mins)
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
cost = [int(i) for i in input().split()]
time = [int(x) for x in input().split()]
(s1, s2) = (0, 0)
for i in range(1, n + 1):
	s1 += max(0, cost[i - 1] - c * sum(time[:i]))
	s2 += max(0, cost[-i] - c * sum(time[-i:]))
if s1 > s2:
	print('Limak')
elif s1 < s2:
	print('Radewoosh')
else:
	print('Tie')


def fon(l, t, c, r):
	d = 0
	e = 0
	for i in range(r):
		d += t[i]
		if l[i] - c * d > 0:
			e += l[i] - c * d
		else:
			pass
	return e
(n, c) = map(int, input().split())
l = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
l1 = l[::-1]
t1 = t[::-1]
a = fon(l, t, c, n)
b = fon(l1, t1, c, n)
if a > b:
	print('Limak')
elif a < b:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
score = list(map(int, input().split()))
time = list(map(int, input().split()))
limakScore = 0
timeLimak = time[0]
for i in range(n):
	limakScore += max(0, score[i] - c * timeLimak)
	try:
		timeLimak += time[i + 1]
	except:
		pass
radeScore = 0
timeRade = time[n - 1]
for j in range(n - 1, -1, -1):
	radeScore += max(0, score[j] - c * timeRade)
	try:
		timeRade += time[i - 1]
	except:
		pass
if radeScore > limakScore:
	print('Radewoosh')
elif radeScore < limakScore:
	print('Limak')
else:
	print('Tie')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
(sum1, sum2) = (0, 0)
(l1, l2) = (0, 0)
for i in range(n):
	sum1 += b[i]
	l1 += max(a[i] - sum1 * k, 0)
	sum2 += b[n - 1 - i]
	l2 += max(a[n - 1 - i] - sum2 * k, 0)
if l1 > l2:
	print('Limak')
elif l1 == l2:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = input().split()
n = int(n)
c = int(c)
p = input().split()
t = input().split()
x = 0
r1 = 0
r2 = 0
for i in range(0, n):
	x += int(t[i])
	r1 += max(0, int(p[i]) - c * x)
x = 0
for i in range(n - 1, -1, -1):
	x += int(t[i])
	r2 += max(0, int(p[i]) - c * x)
if r1 > r2:
	print('Limak')
if r1 < r2:
	print('Radewoosh')
if r1 == r2:
	print('Tie')


R = lambda : [int(x) for x in input().split()]
(nb_problems, score_factor) = R()
scores = R()
times = R()

def calc_score(u, v):
	(x, y) = (0, 0)
	for i in range(nb_problems):
		y += v[i]
		x += max(0, u[i] - y * score_factor)
	return x
limak = calc_score(scores, times)
radew = calc_score(scores[::-1], times[::-1])
if limak == radew:
	print('Tie')
elif limak > radew:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
scores = list(map(int, input().split()))
t = list(map(int, input().split()))
time1 = 0
time2 = 0
l = []
r = []
y = n - 1
for i in range(n):
	time1 += t[i]
	x = scores[i] - c * time1
	l.append(max(0, x))
	time2 += t[y]
	k = scores[y] - c * time2
	r.append(max(0, k))
	y -= 1
if sum(l) > sum(r):
	print('Limak')
elif sum(r) > sum(l):
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l = list(map(int, input().split()))
z = 0
b = 0
count = 0
plus = 0
s = list(map(int, input().split()))
for i in range(n):
	z = z + s[i]
	m = max(l[i] - c * z, 0)
	count = count + m
Limak = count
for j in range(n - 1, -1, -1):
	b = b + s[j]
	w = max(l[j] - c * b, 0)
	plus = plus + w
Radewoosh = plus
if Limak > Radewoosh:
	print('Limak')
elif Radewoosh > Limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
pn = p[::-1]
tn = t[::-1]
l = 0
r = 0
lt = 0
rt = 0
for i in range(n):
	lt += t[i]
	l += max(0, p[i] - lt * c)
	rt += tn[i]
	r += max(0, pn[i] - rt * c)
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
cnt_l = 0
cnt_r = 0
for i in range(n):
	cnt_l += max(0, p[i] - c * sum(t[:i + 1]))
for i in range(n - 1, -1, -1):
	cnt_r += max(0, p[i] - c * sum(t[i:]))
if cnt_l > cnt_r:
	print('Limak')
elif cnt_l < cnt_r:
	print('Radewoosh')
else:
	print('Tie')


l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
l3 = list(map(int, input().split()))
sr = 0
sl = 0
t = 0
for i in range(l1[0]):
	t += l3[i]
	sl += max(0, l2[i] - l1[1] * t)
l2.reverse()
l3.reverse()
t = 0
for i in range(l1[0]):
	t += l3[i]
	sr += max(0, l2[i] - l1[1] * t)
if sr == sl:
	print('Tie')
elif sr > sl:
	print('Radewoosh')
elif sl > sr:
	print('Limak')


(n, c) = map(int, input().split(' '))
(lim, time1, rad, time2) = (0, 0, 0, 0)
probl = [int(i) for i in input().split(' ')]
x = [int(j) for j in input().split(' ')]
for k in probl:
	time1 += x[probl.index(k)]
	lim += max(0, k - c * time1)
rev = probl[::-1]
xrev = x[::-1]
for y in rev:
	time2 += xrev[rev.index(y)]
	rad += max(0, y - c * time2)
if lim > rad:
	print('Limak')
elif rad > lim:
	print('Radewoosh')
else:
	print('Tie')


def count_point(scores, times, n, c):
	score = 0
	time = 0
	for i in range(n):
		time += times[i]
		score += max(0, scores[i] - c * time)
	return score

def main():
	[n, c] = [int(_) for _ in input().split()]
	scores = [int(_) for _ in input().split()]
	times = [int(_) for _ in input().split()]
	limak = count_point(scores, times, n, c)
	radewoosh = count_point(list(reversed(scores)), list(reversed(times)), n, c)
	print('Limak' if limak > radewoosh else 'Radewoosh' if radewoosh > limak else 'Tie')
main()


(n, c) = list(map(int, input().split(' ')))
combined = list(zip(list(map(int, input().split(' '))), list(map(int, input().split(' ')))))
limak = 0
time = 0
for item in combined:
	time += item[1]
	limak += max(0, item[0] - c * time)
time = 0
radewoosh = 0
for item in reversed(combined):
	time += item[1]
	radewoosh += max(0, item[0] - c * time)
if limak > radewoosh:
	print('Limak')
elif radewoosh > limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l = list(map(int, input().split()))
t = list(map(int, input().split()))
li = 0
rd = 0
tu = 0
t1 = 0
for i in range(len(l)):
	tu = tu + t[i]
	k = l[i] - c * tu
	li = li + max(0, k)
for i in reversed(range(len(l))):
	t1 = t1 + t[i]
	tk = l[i] - c * t1
	rd = rd + max(0, tk)
if li > rd:
	print('Limak')
elif rd > li:
	print('Radewoosh')
else:
	print('Tie')


I = lambda : map(int, input().split())
(n, c) = I()
(P, T) = (list(I()), list(I()))
(L, R) = ([0] * n, [0] * n)
for i in range(n):
	(L[i], R[-i - 1]) = (L[i - 1] + T[i], R[-i] + T[-i - 1])
L = sum((max(0, p - c * x) for (p, x) in zip(P, L)))
R = sum((max(0, p - c * x) for (p, x) in zip(P, R)))
print('Limak' if L > R else 'Radewoosh' if L < R else 'Tie')


from sys import stdin as Si
from itertools import combinations_with_replacement as Cr
(n, c) = map(int, Si.readline().split())
S = tuple(map(int, Si.readline().split()))
T = tuple(map(int, Si.readline().split()))
(L, R) = (0, 0)
for i in range(n):
	L += max(0, S[i] - sum(T[:i + 1]) * c)
	R += max(0, S[n - 1 - i] - sum(T[n - 1 - i:]) * c)
if L > R:
	print('Limak')
elif R > L:
	print('Radewoosh')
else:
	print('Tie')


(num, c) = list(map(int, input().split()))
scores = list(map(int, input().split()))
times = list(map(int, input().split()))
length = len(scores)
limak = [max(0, scores[i] - sum(times[:i + 1]) * c) for i in range(length)]
radew = [max(0, scores[i] - sum(times[i - length:]) * c) for i in range(length - 1, -1, -1)]
if sum(limak) > sum(radew):
	print('Limak')
elif sum(limak) < sum(radew):
	print('Radewoosh')
else:
	print('Tie')


def partial_sum(iter):
	total = 0
	for i in iter:
		total += i
		yield total
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
score_limak = sum((max(0, p_i - x_i * c) for (x_i, p_i) in zip(partial_sum(t), p)))
score_rade = sum((max(0, p_i - x_i * c) for (x_i, p_i) in zip(partial_sum(reversed(t)), reversed(p))))
if score_limak > score_rade:
	print('Limak')
elif score_limak < score_rade:
	print('Radewoosh')
else:
	print('Tie')


n = list(map(int, input().split()))
L1 = list(map(int, input().split()))
L2 = list(map(int, input().split()))
X = 0
SCORE = [0, 0]
for _ in range(len(L1)):
	X += L2[_]
	SCORE[0] += max(0, L1[_] - n[1] * X)
X = 0
for _ in range(len(L1) - 1, -1, -1):
	X += L2[_]
	SCORE[1] += max(0, L1[_] - n[1] * X)
	if SCORE[1] > SCORE[0]:
		print('Radewoosh')
		exit()
print('Tie' if SCORE[0] == SCORE[1] else 'Limak')


import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *

class Scanner:

	@staticmethod
	def int():
		return int(sys.stdin.readline().rstrip())

	@staticmethod
	def string():
		return sys.stdin.readline().rstrip()

	@staticmethod
	def map_int():
		return [int(x) for x in Scanner.string().split()]

	@staticmethod
	def string_list(n):
		return [input() for i in range(n)]

	@staticmethod
	def int_list_list(n):
		return [Scanner.map_int() for i in range(n)]

	@staticmethod
	def int_cols_list(n):
		return [int(input()) for i in range(n)]

class Math:

	@staticmethod
	def gcd(a, b):
		if b == 0:
			return a
		return Math.gcd(b, a % b)

	@staticmethod
	def lcm(a, b):
		return a * b // Math.gcd(a, b)

	@staticmethod
	def divisor(n):
		res = []
		i = 1
		for i in range(1, int(n ** 0.5) + 1):
			if n % i == 0:
				res.append(i)
				if i != n // i:
					res.append(n // i)
		return res

	@staticmethod
	def round_up(a, b):
		return -(-a // b)

	@staticmethod
	def is_prime(n):
		if n < 2:
			return False
		if n == 2:
			return True
		if n % 2 == 0:
			return False
		d = int(n ** 0.5) + 1
		for i in range(3, d + 1, 2):
			if n % i == 0:
				return False
		return True

def pop_count(x):
	x = x - (x >> 1 & 6148914691236517205)
	x = (x & 3689348814741910323) + (x >> 2 & 3689348814741910323)
	x = x + (x >> 4) & 1085102592571150095
	x = x + (x >> 8)
	x = x + (x >> 16)
	x = x + (x >> 32)
	return x & 127
MOD = int(1000000000.0) + 7
INF = int(1000000000000000.0)

def solve():
	(N, C) = Scanner.map_int()
	P = Scanner.map_int()
	T = Scanner.map_int()
	l = 0
	x = 0
	for i in range(N):
		x += T[i]
		l += max(0, P[i] - C * x)
	r = 0
	x = 0
	for i in reversed(range(N)):
		x += T[i]
		r += max(0, P[i] - C * x)
	if l == r:
		print('Tie')
	elif l > r:
		print('Limak')
	else:
		print('Radewoosh')

def main():
	solve()
main()


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
x1 = t[0]
x2 = t[n - 1]
a1 = max(0, p[0] - x1 * c)
a2 = max(0, p[n - 1] - x2 * c)
for i in range(1, n):
	x1 += t[i]
	a1 += max(0, p[i] - x1 * c)
for i in range(2, n + 1):
	x2 += t[n - i]
	a2 += max(0, p[n - i] - x2 * c)
if a1 > a2:
	print('Limak')
elif a2 > a1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
(s1, sr1) = (0, 0)
for i in range(n):
	s1 += l2[i]
	sr1 += max(0, l1[i] - c * s1)
(s1, sr2) = (0, 0)
for i in range(n - 1, -1, -1):
	s1 += l2[i]
	sr2 += max(0, l1[i] - c * s1)
if sr1 > sr2:
	print('Limak')
elif sr2 > sr1:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = input().split()
a = int(a)
b = int(b)
c = input().split()
v = input().split()
l = 0
r = 0
t = 0
for i in range(a):
	t += int(v[i])
	if int(c[i]) - b * t >= 0:
		l += int(c[i]) - b * t
t = 0
for i in range(a - 1, 0, -1):
	t += int(v[i])
	if int(c[i]) - b * t >= 0:
		r += int(c[i]) - b * t
if r > l and a != 1:
	print('Radewoosh')
elif l > r and a != 1:
	print('Limak')
else:
	print('Tie')


x = [int(i) for i in input().split()]
(n, c) = (x[0], x[1])
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
pt1 = [(p[i], sum(t[0:i + 1])) for i in range(n)]
pt2 = [(p[-i], sum(t[-1:-i - 1:-1])) for i in range(1, n + 1)]
(s1, s2) = (0, 0)
for i in pt1:
	s1 += max(0, i[0] - c * i[1])
for i in pt2:
	s2 += max(0, i[0] - c * i[1])
if s1 != s2:
	print('Limak' if s1 > s2 else 'Radewoosh')
else:
	print('Tie')


(n, c) = list(map(int, input().split()))
l = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
T = 0
T1 = 0
ans = ans2 = 0
for i in range(n):
	T += t[i]
	ans += max(0, l[i] - T * c)
	T1 += t[n - i - 1]
	ans2 += max(0, l[n - i - 1] - T1 * c)
if ans > ans2:
	print('Limak')
elif ans2 > ans:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = list(map(int, input().split()))
s = e = f = t = int(0)
for x in range(a):
	s = s + d[x]
	t = c[x] - s * b
	if t >= 0:
		e = e + t
y = a - 1
s = t = int(0)
while y >= 0:
	s = s + d[y]
	t = c[y] - s * b
	if t >= 0:
		f = f + t
	y = y - 1
if e > f:
	print('Limak')
elif e < f:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
in1 = list(map(int, input().split()))
in2 = list(map(int, input().split()))
(t1, t2, op1, op2) = (0, 0, 0, 0)
for i in range(0, n):
	t1 += in2[i]
	op1 += in1[i] - c * t1 if in1[i] - c * t1 > 0 else 0
	t2 += in2[n - i - 1]
	op2 += in1[n - i - 1] - c * t2 if in1[n - i - 1] - c * t2 > 0 else 0
if op1 == op2:
	print('Tie')
else:
	print('Limak' if op1 > op2 else 'Radewoosh')


(a, b) = map(int, input().split())
i = list(map(int, input().split()))
j = list(map(int, input().split()))
(Limak, Radewoosh, d, e) = (0, 0, 0, 0)
for x in range(a):
	d += j[x]
	Limak += max(0, i[x] - d * b)
	e += j[a - 1 - x]
	Radewoosh += max(0, i[a - 1 - x] - e * b)
if Limak == Radewoosh:
	print('Tie')
elif Limak > Radewoosh:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
li = ra = ti = 0
for i in range(n):
	ti += t[i]
	li = max(li, li + p[i] - c * ti)
p.reverse()
t.reverse()
ti = 0
for i in range(n):
	ti += t[i]
	ra = max(ra, ra + p[i] - c * ti)
if li > ra:
	print('Limak')
elif ra > li:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l = list(map(int, input().split()))
d = list(map(int, input().split()))
(x, y) = (0, 0)
(s, ka, t, h) = (0, 0, 0, 0)
for i in range(n):
	t = t + d[i]
	m = max(0, l[i] - c * t)
	s = s + m
for i in range(n - 1, -1, -1):
	h = h + d[i]
	m = max(0, l[i] - c * h)
	ka = ka + m
if s == ka:
	print('Tie')
elif s > ka:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = (int(x) for x in input().split())
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
l = sum([max(0, p[i] - c * sum(t[0:i + 1])) for i in range(n)])
p.reverse()
t.reverse()
r = sum([max(0, p[i] - c * sum(t[0:i + 1])) for i in range(n)])
if r > l:
	print('Radewoosh')
elif r < l:
	print('Limak')
else:
	print('Tie')


n = list(map(int, input().split()))
n1 = list(map(int, input().split()[:n[0]]))
n2 = list(map(int, input().split()[:n[0]]))
s = 0
q = 0
x = 0
y = 0
z = 0
for i in range(n[0]):
	s = s + n2[i]
	w = n1[i] - n[1] * s
	if w < 0:
		w = w - w
	q = q + w
for j in range(n[0] - 1, -1, -1):
	x = x + n2[j]
	y = n1[j] - n[1] * x
	if y < 0:
		y = y - y
	z = z + y
if z > q:
	print('Radewoosh')
elif z < q:
	print('Limak')
elif z == q:
	print('Tie')


(n, c) = map(int, input().split())
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
t1 = []
t_l = 0
for i in t:
	t_l += i
	t1.append(t_l)
t2 = []
t_r = 0
for i in reversed(t):
	t_r += i
	t2.append(t_r)
p1 = p
p2 = list(reversed(p))
limak = 0
revad = 0
j = 0
k = 0
for i in range(1, sum(t) + 1):
	if i in t1:
		if p1[j] - i * c >= 0:
			limak += p1[j] - i * c
		j += 1
	if i in t2:
		if p2[k] - i * c >= 0:
			revad += p2[k] - i * c
		k += 1
if limak > revad:
	print('Limak')
elif revad > limak:
	print('Radewoosh')
else:
	print('Tie')


import math
from math import floor
line1 = input().split()
line2 = input().split()
line3 = input().split()
number = int(line1[0])
c = int(line1[1])
lScore = []
for i in line2:
	lScore.append(int(i))
rScore = []
rScore = lScore[::-1]
time = []
for i in line3:
	time.append(int(i))
lTime = time
rTime = time[::-1]
for i in range(1, number):
	lTime[i] = lTime[i] + lTime[i - 1]
	rTime[i] = rTime[i] + rTime[i - 1]
la = 0
ra = 0
for i in range(0, number):
	la += max(0, lScore[i] - lTime[i] * c)
	ra += max(0, rScore[i] - rTime[i] * c)
if la > ra:
	print('Limak')
elif la < ra:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
initial_score = list(map(int, input().split()))
time_taken = list(map(int, input().split()))
(limak, radewoosh, time_count1, time_count2) = (0, 0, 0, 0)
for i in range(n):
	time_count1 = time_count1 + time_taken[i]
	time_count2 = time_count2 + time_taken[n - i - 1]
	if initial_score[i] - c * time_count1 > 0:
		limak = limak + initial_score[i] - c * time_count1
	if initial_score[n - i - 1] - c * time_count2 > 0:
		radewoosh = radewoosh + initial_score[n - i - 1] - c * time_count2
if limak > radewoosh:
	print('Limak')
elif radewoosh > limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
score = list(map(int, input().split()))
time = list(map(int, input().split()))
elapsed_time = 0
Limak = 0
for i in range(n):
	elapsed_time += time[i]
	Limak += max(0, score[i] - c * elapsed_time)
elapsed_time = 0
Rade = 0
time.reverse()
score.reverse()
for i in range(n):
	elapsed_time += time[i]
	Rade += max(0, score[i] - c * elapsed_time)
if Limak > Rade:
	print('Limak')
elif Rade > Limak:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = list(map(int, input().split()))
s = list(map(int, input().split()))
t1 = list(map(int, input().split()))
t2 = t1.copy()
t2.reverse()
sum1 = 0
sum2 = 0
for i in range(1, a):
	t1[i] += t1[i - 1]
	t2[i] += t2[i - 1]
for i in range(a):
	if s[i] - b * t1[i] > 0:
		sum1 += s[i] - b * t1[i]
	if s[a - i - 1] - b * t2[i] > 0:
		sum2 += s[a - i - 1] - b * t2[i]
if sum1 > sum2:
	print('Limak')
elif sum2 > sum1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l = list(map(int, input().split()))
t = list(map(int, input().split()))
for i in range(len(t)):
	k = []
	w = []
	for j in range(i + 1):
		w.append(t[j])
		s = sum(w)
		k.append(s)
for i in range(len(t)):
	K = []
	W = []
	for j in range(i + 1):
		W.append(t[-(j + 1)])
		S = sum(W)
		K.append(S)
doubt = 0
for i in range(len(t)):
	if l[i] - c * k[i] > 0:
		doubt += l[i] - c * k[i]
	else:
		continue
doubt2 = 0
for i in range(len(t)):
	if l[-(i + 1)] - c * K[i] > 0:
		doubt2 = doubt2 + l[-(i + 1)] - c * K[i]
	else:
		continue
if doubt > doubt2:
	print('Limak')
elif doubt == doubt2:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
score = list(map(int, input().split()))
time = list(map(int, input().split()))
limakScore = 0
Cumtime = 0
for (s, t) in zip(score, time):
	Cumtime += t
	limakScore += max(0, s - c * Cumtime)
radeScore = 0
Cumtime = 0
for (s, t) in zip(score[::-1], time[::-1]):
	Cumtime += t
	radeScore += max(0, s - c * Cumtime)
print('Radewoosh' if radeScore > limakScore else ['Tie', 'Limak'][radeScore < limakScore])


(n, c) = map(int, input().split(' '))
p = list(map(int, input().split(' ')))
t = list(map(int, input().split(' ')))
limak_score = 0
x = 0
for i in range(n):
	x += t[i]
	limak_score += max(0, p[i] - c * x)
radewoosh_score = 0
x = 0
for i in reversed(range(n)):
	x += t[i]
	radewoosh_score += max(0, p[i] - c * x)
if limak_score > radewoosh_score:
	print('Limak')
elif limak_score == radewoosh_score:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
a = b = 0
s = t = 0
for i in range(n):
	a += B[i]
	s += max(A[i] - c * a, 0)
A = A[::-1]
B = B[::-1]
for i in range(n):
	b += B[i]
	t += max(A[i] - c * b, 0)
if s > t:
	print('Limak')
if s < t:
	print('Radewoosh')
if s == t:
	print('Tie')


(n, c) = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
(Limak, Radewoosh) = (0, 0)
if len(a) == 1:
	print('Tie')
else:
	for i in range(len(a)):
		Limak += max([0, a[i] - c * sum(b[0:i + 1])])
	for j in range(len(a) - 1, 0, -1):
		Radewoosh += max([0, a[j] - c * sum(b[j:])])
	if Limak > Radewoosh:
		print('Limak')
	elif Radewoosh > Limak:
		print('Radewoosh')
	else:
		print('Tie')


L = [int(s) for s in input().split()]
(n, c) = (L[0], L[1])
P = [int(s) for s in input().split()]
T = [int(s) for s in input().split()]
T_L = [T[0] for i in range(n)]
for i in range(1, n):
	T_L[i] = T_L[i - 1] + T[i]
P_L = sum([max(0, P[i] - c * T_L[i]) for i in range(n)])
T_R = [T[n - 1] for i in range(n)]
for i in range(n - 2, -1, -1):
	T_R[i] = T_R[i + 1] + T[i]
P_R = sum([max(0, P[i] - c * T_R[i]) for i in range(n)])
if P_L > P_R:
	print('Limak')
elif P_L == P_R:
	print('Tie')
else:
	print('Radewoosh')


I = lambda : list(map(int, input().split()))
(n, c) = I()
(a, b) = (I(), I())
x = r = 0
for (p, t) in zip(a, b):
	x += t
	r += max(0, p - x * c)
x = 0
for (p, t) in zip(a[::-1], b[::-1]):
	x += t
	r -= max(0, p - x * c)
print('Limak' if r > 0 else ['Tie', 'Radewoosh'][r < 0])


(n, c) = tuple(map(int, input().split()))
ps = list(map(int, input().split()))
ts = list(map(int, input().split()))
limak_points = 0
r_points = 0
x = 0
for i in range(n):
	x += ts[i]
	limak_points += max(0, ps[i] - c * x)
x = 0
for i in range(n):
	x += ts[n - 1 - i]
	r_points += max(0, ps[n - 1 - i] - c * x)
if limak_points > r_points:
	print('Limak')
elif r_points > limak_points:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
P = list(map(int, input().split()))
T = list(map(int, input().split()))
l = 0
x = 0
for i in range(len(P)):
	x += T[i]
	l += max(0, P[i] - c * x)
x = 0
r = 0
for i in range(len(P) - 1, -1, -1):
	x += T[i]
	r += max(0, P[i] - c * x)
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


from itertools import accumulate
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
L = list(accumulate(t))
R = list(accumulate(t[::-1]))[::-1]
sum_l = sum(map(lambda i: max(0, p[i] - L[i] * c), range(n)))
sum_r = sum(map(lambda i: max(0, p[i] - R[i] * c), range(n)))
if sum_l > sum_r:
	print('Limak')
elif sum_l < sum_r:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
c1 = 0
c2 = 0
t = 0
for i in range(n):
	t += l2[i]
	c1 += max(0, l1[i] - c * t)
l1.reverse()
l2.reverse()
t = 0
for i in range(n):
	t += l2[i]
	c2 += max(0, l1[i] - c * t)
if c1 > c2:
	print('Limak')
elif c1 < c2:
	print('Radewoosh')
else:
	print('Tie')


def get(p, t, n, c):
	x = 0
	ans = 0
	for i in range(n):
		x += t[i]
		ans += max(0, p[i] - c * x)
	return ans
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
a = get(p, t, n, c)
b = get(p[::-1], t[::-1], n, c)
if a > b:
	print('Limak')
elif a == b:
	print('Tie')
else:
	print('Radewoosh')


import time
(n, c) = (int(i) for i in input().split())
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
start = time.time()
tnow = 0
T = sum(t)
sl = 0
sr = 0
for i in range(n):
	sr += max(0, p[i] - c * (T - tnow))
	tnow += t[i]
	sl += max(0, p[i] - c * tnow)
if sl > sr:
	print('Limak')
elif sl == sr:
	print('Tie')
else:
	print('Radewoosh')
finish = time.time()


def main():
	(n, c) = [int(t) for t in input().split()]
	p = [int(t) for t in input().split()]
	t = [int(t) for t in input().split()]
	(limak_score, x) = (0, 0)
	for (pi, ti) in zip(p, t):
		x += ti
		limak_score += max(0, pi - c * x)
	(radewoosh_score, x) = (0, 0)
	for (pi, ti) in zip(reversed(p), reversed(t)):
		x += ti
		radewoosh_score += max(0, pi - c * x)
	if limak_score > radewoosh_score:
		print('Limak')
	elif radewoosh_score > limak_score:
		print('Radewoosh')
	else:
		print('Tie')

def __starting_point():
	main()
__starting_point()


ques_c = input().split(' ')
ques = int(ques_c[0])
c = int(ques_c[1])
time_limak = 0
time_rade = 0
initial_scores = input().split(' ')
initial_scores = [int(initial_scores[i]) for i in range(ques)]
time_score = input().split(' ')
time_score = [int(time_score[i]) for i in range(ques)]
limak_score = 0
rade_score = 0
count = 0
for i in range(ques):
	time_limak += time_score[count]
	if initial_scores[count] - c * time_limak > 0:
		limak_score += initial_scores[count] - c * time_limak
	count += 1
count -= 1
for i in range(ques):
	time_rade += time_score[count]
	if initial_scores[count] - c * time_rade > 0:
		rade_score += initial_scores[count] - c * time_rade
	count -= 1
if limak_score > rade_score:
	print('Limak')
elif limak_score == rade_score:
	print('Tie')
else:
	print('Radewoosh')


entrada = input()
entrada = entrada.split()
n = int(entrada[0])
c = int(entrada[1])
initial_scores = input()
initial_scores = initial_scores.split()
initial_scores = [int(x) for x in initial_scores]
minutes_per_problem = input()
minutes_per_problem = minutes_per_problem.split()
minutes_per_problem = [int(x) for x in minutes_per_problem]
limark_score = 0
radewoosh_score = 0
x_1 = 0
x_2 = 0
for i in range(n):
	x_1 += minutes_per_problem[i]
	x_2 += minutes_per_problem[n - i - 1]
	limark_score += max(0, initial_scores[i] - c * x_1)
	radewoosh_score += max(0, initial_scores[n - i - 1] - c * x_2)
ans = 'Tie'
if limark_score > radewoosh_score:
	ans = 'Limak'
elif limark_score < radewoosh_score:
	ans = 'Radewoosh'
print(ans)


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
lmk = 0
rdw = 0
for i in range(n):
	lmk += max(0, p[i] - c * sum(t[:i + 1]))
for i in range(n - 1, -1, -1):
	rdw += max(0, p[i] - c * sum(t[i:]))
if lmk == rdw:
	print('Tie')
if lmk > rdw:
	print('Limak')
if lmk < rdw:
	print('Radewoosh')


(n, c) = map(int, input().split())
P = list(map(int, input().split()))
T = list(map(int, input().split()))
a = 0
t = 0
for i in range(n):
	t += T[i]
	a += max(0, P[i] - c * t)
t = 0
b = 0
for i in range(n - 1, -1, -1):
	t += T[i]
	b += max(0, P[i] - c * t)
if a > b:
	print('Limak')
elif a < b:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(x) for x in input().split(' ')]
P = [int(x) for x in input().split(' ')]
T = [int(x) for x in input().split(' ')]

def score(P, T, c):
	s = 0
	x = 0
	for (p, t) in zip(P, T):
		x += t
		s += max(0, p - c * x)
	return s
Limak = score(P, T, c)
Radewoosh = score(reversed(P), reversed(T), c)
if Limak > Radewoosh:
	print('Limak')
elif Limak < Radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = tuple(map(int, input().split()))
t = list(map(int, input().split()))
limak_t = 0
radewoosh_t = 0
limak = 0
radewoosh = 0
for i in range(n):
	limak_t += t[i]
	radewoosh_t += t[n - i - 1]
	limak += max(0, p[i] - c * limak_t)
	radewoosh += max(0, p[n - i - 1] - c * radewoosh_t)
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, m) = input().split()
n = int(n)
m = int(m)
l = 0
r = 0
t1 = 0
t2 = 0
ar1 = input().split()
ar2 = input().split()
for i in range(n):
	ar1[i] = int(ar1[i])
	ar2[i] = int(ar2[i])
for i in range(n):
	t1 += ar2[i]
	l += max(0, ar1[i] - m * t1)
for i in range(n - 1, -1, -1):
	t2 += ar2[i]
	r += max(0, ar1[i] - m * t2)
if l > r:
	print('Limak')
elif l == r:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
point = [*map(int, input().split())]
time = [*map(int, input().split())]
(count1, count2) = (0, 0)
(limak, rade) = (0, 0)
for i in range(n):
	count1 += time[i]
	limak += max(point[i] - c * count1, 0)
	count2 += time[n - i - 1]
	rade += max(point[n - i - 1] - c * count2, 0)
if limak > rade:
	print('Limak')
elif rade > limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
ti = 0
p1 = 0
for i in range(n):
	ti += t[i]
	p1 += max(0, p[i] - c * ti)
ti = 0
p2 = 0
for i in range(n - 1, -1, -1):
	ti += t[i]
	p2 += max(0, p[i] - c * ti)
if p1 > p2:
	print('Limak')
elif p2 > p1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
t1 = 0
p1 = 0
for (i, val) in enumerate(p):
	t1 += t[i]
	p1 += max(0, val - t1 * c)
t2 = 0
p2 = 0
p = p[::-1]
t = t[::-1]
for (i, val) in enumerate(p):
	t2 += t[i]
	p2 += max(0, val - t2 * c)
if p1 > p2:
	print('Limak')
elif p1 < p2:
	print('Radewoosh')
else:
	print('Tie')


ch = input()
d = ch.split()
n = int(d[0])
c = int(d[1])
ch = input()
P = ch.split()
ch = input()
T = ch.split()
L = 0
R = 0
(t1, t2) = (0, 0)
for i in range(n):
	t1 += int(T[i])
	t2 += int(T[n - i - 1])
	L += max(0, int(P[i]) - t1 * c)
	R += max(0, int(P[n - 1 - i]) - t2 * c)
if L > R:
	print('Limak')
elif L == R:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
rating = list(map(int, input().split()))
time = list(map(int, input().split()))
l = 0
r = 0
t1 = 0
t2 = 0
for i in range(n):
	rat = rating[i]
	t1 += time[i]
	change = rat - c * t1
	if change > 0:
		l += change
for i in range(n - 1, -1, -1):
	rat = rating[i]
	t2 += time[i]
	change = rat - c * t2
	if change > 0:
		r += change
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
t1 = [0] * n
t2 = [0] * n
t1[0] = l2[0]
t2[n - 1] = l2[n - 1]
for i in range(1, n):
	t1[i] = l2[i] + t1[i - 1]
for i in range(n - 2, -1, -1):
	t2[i] = l2[i] + t2[i + 1]
l = r = 0
for i in range(n):
	l += max(0, l1[i] - c * t1[i])
for i in range(n):
	r += max(0, l1[i] - c * t2[i])
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


import math
limak_point = 0
radev_point = 0
limak_time = 0
radev_time = 0
(n, c) = input().split()
n = int(n)
c = int(c)
p = input().split()
t = input().split()
for i in range(len(p)):
	limak_time += int(t[i])
	limak_point += max(0, int(p[i]) - c * limak_time)
	radev_time += int(t[n - 1 - i])
	radev_point += max(0, int(p[n - 1 - i]) - c * radev_time)
if limak_point > radev_point:
	print('Limak')
elif limak_point < radev_point:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
tim = 0
lim = 0
for i in range(n):
	tim += t[i]
	lim += max(0, p[i] - c * tim)
tim = 0
rad = 0
for i in range(n - 1, -1, -1):
	tim += t[i]
	rad += max(0, p[i] - c * tim)
if lim > rad:
	print('Limak')
elif lim < rad:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = list(map(int, input().split()))
p = list(map(int, input().split()))
t = list(map(int, input().split()))
res1 = 0
t1 = 0
res2 = 0
t2 = 0
for i in range(n):
	t1 += t[i]
	res1 += max(p[i] - c * t1, 0)
	t2 += t[n - i - 1]
	res2 += max(p[n - i - 1] - c * t2, 0)
if res1 > res2:
	print('Limak')
elif res2 > res1:
	print('Radewoosh')
else:
	print('Tie')


'__author__' == 'deepak Singh Mehta'
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak = 0
eff = 0
for i in range(len(p)):
	eff += t[i]
	limak += max(0, p[i] - eff * c)
rade = 0
eff = 0
for i in range(len(p) - 1, -1, -1):
	eff += t[i]
	rade += max(0, p[i] - eff * c)
if limak > rade:
	print('Limak')
elif limak < rade:
	print('Radewoosh')
else:
	print('Tie')


def solve(n, c, a1, a2):
	curr = 0
	ans = 0
	for i in range(n):
		curr += a2[i]
		ans += max(0, a1[i] - c * curr)
	return ans
(n, c) = map(int, input().split())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
s1 = s2 = 0
r1 = solve(n, c, a1, a2)
r2 = solve(n, c, a1[::-1], a2[::-1])
if r1 > r2:
	print('Limak')
elif r1 == r2:
	print('Tie')
else:
	print('Radewoosh')


def cumsum(lst):
	x = [lst[0]]
	for i in range(1, len(lst)):
		x.append(x[i - 1] + lst[i])
	return x
(n, c) = tuple(map(int, input().strip(' ').split(' ')))
p = list(map(int, input().strip(' ').split(' ')))
t = list(map(int, input().strip(' ').split(' ')))
t_1 = cumsum(t)
limak = sum(list(map(lambda x: max(0, x[0] - c * x[1]), zip(p, t_1))))
p.sort(reverse=True)
t.sort(reverse=True)
t_1 = cumsum(t)
radewoosh = sum(list(map(lambda x: max(0, x[0] - c * x[1]), zip(p, t_1))))
if limak > radewoosh:
	print('Limak')
elif radewoosh > limak:
	print('Radewoosh')
else:
	print('Tie')


def points(n, c, p, t):
	sum = tm = 0
	for i in range(n):
		tm += t[i]
		sum += max(0, p[i] - c * tm)
	return sum
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak = points(n, c, p, t)
radew = points(n, c, list(reversed(p)), list(reversed(t)))
if limak == radew:
	print('Tie')
elif limak > radew:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = [int(c) for c in input().split()]
P = [int(c) for c in input().split()]
T = [int(c) for c in input().split()]
x = 0
points_l = 0
for (p, t) in zip(P, T):
	x += t
	points_l += max(0, p - c * x)
x = 0
points_r = 0
for (p, t) in reversed(list(zip(P, T))):
	x += t
	points_r += max(0, p - c * x)
if points_l > points_r:
	print('Limak')
elif points_l < points_r:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
l = []
r = []
for i in range(n):
	k = t[:i + 1]
	w = sum(k)
	x = p[i] - c * w
	if x < 0:
		x = 0
	l.append(x)
e = sum(l)
b = t[::-1]
d = p[::-1]
for i in range(n):
	f = b[:i + 1]
	g = sum(f)
	h = d[i] - c * g
	if h < 0:
		h = 0
	r.append(h)
i = sum(r)
if e > i:
	print('Limak')
elif e < i:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
lima = 0
rade = 0
time1 = 0
time2 = 0
for i in range(n):
	time1 += t[i]
	time2 += t[n - (i + 1)]
	lima += max(0, p[i] - c * time1)
	rade += max(0, p[n - (i + 1)] - c * time2)
if lima > rade:
	print('Limak')
elif rade > lima:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split(' '))
limak = 0
rade = 0
score = input().split(' ')
time = input().split(' ')
lTime = 0
rTime = 0
for i in range(n):
	lTime += int(time[i])
	limak += max(0, int(score[i]) - lTime * c)
	rTime += int(time[n - 1 - i])
	rade += max(0, int(score[n - 1 - i]) - rTime * c)
if limak > rade:
	print('Limak')
elif rade > limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = input().split()
t = input().split()
sl = 0
sr = 0
ti = 0
for i in range(n):
	ti += int(t[i])
	if int(p[i]) - c * ti >= 0:
		sl += int(p[i]) - c * ti
ti = 0
for i in range(n):
	ti += int(t[n - i - 1])
	if int(p[n - i - 1]) - c * ti >= 0:
		sr += int(p[n - i - 1]) - c * ti
if sl == sr:
	print('Tie')
elif sl > sr:
	print('Limak')
else:
	print('Radewoosh')


(n, m) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
curtime = 0
lim = 0
rade = 0
for i in range(n):
	curtime += t[i]
	lim += max(0, p[i] - m * curtime)
curtime = 0
for i in range(n - 1, -1, -1):
	curtime += t[i]
	rade += max(0, p[i] - m * curtime)
if rade > lim:
	print('Radewoosh')
elif lim > rade:
	print('Limak')
else:
	print('Tie')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
add = 0
add2 = 0
t1 = 0
t2 = 0
for i in range(n):
	add += b[i]
	t1 += max(a[i] - add * k, 0)
	add2 += b[n - 1 - i]
	t2 += max(a[n - 1 - i] - add2 * k, 0)
if t1 > t2:
	print('Limak')
elif t1 == t2:
	print('Tie')
else:
	print('Radewoosh')


l = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
x = 0
y = 0
z = 0
w = 0
for i in range(l[0]):
	z = z + b[i]
	w = w + b[l[0] - 1 - i]
	p = a[i] - l[1] * z
	q = a[l[0] - 1 - i] - l[1] * w
	if p > 0:
		x = x + p
	if q > 0:
		y = y + q
if x > y:
	print('Limak')
elif y > x:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = map(int, input().split())
point = list(map(int, input().split()))
time = list(map(int, input().split()))
pointr = point[:]
timer = time[:]
point.reverse()
time.reverse()
limak = 0
rade = 0
lims = 0
rades = 0
for i in range(a):
	lims = lims + timer[i]
	if b * lims <= pointr[i]:
		limak = limak + pointr[i] - b * lims
for i in range(a):
	rades = rades + time[i]
	if b * rades <= point[i]:
		rade = rade + point[i] - b * rades
if limak > rade:
	print('Limak')
elif limak < rade:
	print('Radewoosh')
else:
	print('Tie')


n_c = list(map(int, input().split()))
points = list(map(int, input().split()))
times = list(map(int, input().split()))

def sumElem(position, list):
	sum = 0
	for i in range(position):
		sum += list[i]
	return sum
cumTimes = [sumElem(i, times) for i in range(1, 1 + len(times))]
result = 0
for i in range(n_c[0]):
	result += max(0, points[i] - n_c[1] * cumTimes[i])
times.reverse()
cumTimes2 = [sumElem(i, times) for i in range(1, 1 + len(times))]
points.reverse()
result2 = 0
for i in range(n_c[0]):
	result2 += max(0, points[i] - n_c[1] * cumTimes2[i])
if result > result2:
	print('Limak')
elif result2 > result:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = input().split()
(n, c) = (int(n), int(c))
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
lsum = 0
ltime = 0
for i in range(n):
	ltime += t[i]
	lsum += max(p[i] - ltime * c, 0)
rsum = 0
rtime = 0
for i in range(n - 1, -1, -1):
	rtime += t[i]
	rsum += max(p[i] - rtime * c, 0)
if lsum > rsum:
	print('Limak')
elif lsum == rsum:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
q = [0, 0]
tm = 0
for i in range(n):
	tm += t[i]
	q[0] += max(0, p[i] - c * tm)
tm = 0
for i in list(range(n))[::-1]:
	tm += t[i]
	q[1] += max(0, p[i] - c * tm)
if q[0] > q[1]:
	print('Limak')
elif q[1] > q[0]:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
pl = 0
xl = 0
pr = 0
xr = 0
for i in range(n):
	xl += t[i]
	pl += max(0, p[i] - c * xl)
for j in reversed(range(n)):
	xr += t[j]
	pr += max(0, p[j] - c * xr)
if pl > pr:
	print('Limak')
elif pl == pr:
	print('Tie')
elif pl < pr:
	print('Radewoosh')


(n, c) = list(map(int, input().split()))
p1 = list(map(int, input().split()))
p2 = p1[::-1]
t = list(map(int, input().split()))
t1 = [t[0]]
for x in t[1:]:
	t1 += [t1[-1] + x]
t2 = [t[-1]]
for x in t[:-1][::-1]:
	t2 += [t2[-1] + x]
s1 = s2 = 0
for i in range(n):
	s1 += max(0, p1[i] - c * t1[i])
	s2 += max(0, p2[i] - c * t2[i])
if s1 == s2:
	print('Tie')
if s1 > s2:
	print('Limak')
if s1 < s2:
	print('Radewoosh')


def calcPoint(p, c, x):
	return max(0, p - c * x)

def getScore(plst, tlst, n, c):
	L_map = {}
	R_map = {}
	_TL = 0
	_TR = 0
	for (i, t) in enumerate(tlst):
		_TL += t
		_TR += tlst[len(tlst) - i - 1]
		L_map[i] = _TL
		R_map[i] = _TR
	scoreL = 0
	scoreR = 0
	for i in range(len(plst)):
		x_L = L_map[i]
		x_R = R_map[i]
		scoreL += calcPoint(plst[i], c, x_L)
		scoreR += calcPoint(plst[len(plst) - i - 1], c, x_R)
	if scoreL > scoreR:
		return 'Limak'
	if scoreR > scoreL:
		return 'Radewoosh'
	return 'Tie'

def main():
	first_line = input()
	second_line = input()
	third_line = input()
	first_line = list(map(lambda a: int(a), first_line.split()))
	second_line = list(map(lambda a: int(a), second_line.split()))
	third_line = list(map(lambda a: int(a), third_line.split()))
	n = first_line[0]
	c = first_line[1]
	print(getScore(second_line, third_line, n, c))
main()


(n, c) = map(int, input().split())
ques = list(map(int, input().split()))
time = list(map(int, input().split()))
radewoosh = 0
limak = 0
timecode = 0
for i in range(n):
	timecode += time[i]
	limak += max(0, ques[i] - c * timecode)
radewoosh = 0
timecode = 0
for i in range(n):
	timecode += time[n - 1 - i]
	radewoosh += max(0, ques[n - 1 - i] - c * timecode)
if radewoosh > limak:
	print('Radewoosh')
elif radewoosh < limak:
	print('Limak')
elif radewoosh == limak:
	print('Tie')


import sys, math, bisect
inf = float('inf')
mod = 10 ** 9 + 7

def lcm(a, b):
	return int(a / math.gcd(a, b) * b)

def gcd(a, b):
	return int(math.gcd(a, b))

def binarySearch(a, x):
	i = bisect.bisect_left(a, x)
	if i != len(a) and a[i] == x:
		return i
	else:
		return -1

def lowerBound(a, x):
	i = bisect.bisect_left(a, x)
	if i:
		return i - 1
	else:
		return -1

def upperBound(a, x):
	i = bisect.bisect_right(a, x)
	if i != len(a) + 1 and a[i - 1] == x:
		return i - 1
	else:
		return -1

def freq(a, x):
	z = upperBound(a, x) - lowerBound(a, x)
	if z <= 0:
		return 0
	return z
for _ in range(1):
	(n, c) = map(int, input().split())
	points = list(map(int, input().split()))
	time = list(map(int, input().split()))
	(l, r, t1, t2) = (0, 0, 0, 0)
	for i in range(n):
		t1 += time[i]
		l += max(0, points[i] - t1 * c)
	for i in range(n - 1, -1, -1):
		t2 += time[i]
		r += max(0, points[i] - t2 * c)
	if l > r:
		print('Limak')
	elif r > l:
		print('Radewoosh')
	else:
		print('Tie')


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = list(map(int, input().split()))
cnt = 0
e = 0
cnd = 0
f = 0
for i in range(a):
	cnt += max(0, c[i] - b * (d[i] + e))
	e += d[i]
i += 1
for j in range(a):
	cnd += max(0, c[a - 1 - j] - b * (d[a - 1 - j] + f))
	f += d[a - 1 - j]
j += 1
if cnt > cnd:
	print('Limak')
elif cnd > cnt:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
(l_time, l_score) = (0, 0)
(r_time, r_score) = (0, 0)
for pi in range(0, len(p)):
	l_time += t[pi]
	l_score += max(0, p[pi] - l_time * c)
	r_time += t[-1 - pi]
	r_score += max(0, p[-1 - pi] - r_time * c)
print('Limak' if l_score > r_score else 'Tie' if l_score == r_score else 'Radewoosh')


(n, c) = map(int, input().split())
scores = [int(p) for p in input().split()]
minutes = [int(t) for t in input().split()]
t1 = 0
t2 = sum(minutes)
s1 = 0
s2 = 0
for i in range(n):
	t1 += minutes[i]
	s1 += max(0, scores[i] - t1 * c)
	s2 += max(0, scores[i] - t2 * c)
	t2 -= minutes[i]
if s1 > s2:
	print('Limak')
elif s1 < s2:
	print('Radewoosh')
else:
	print('Tie')


def solve(c, ps, ts):
	s1 = 0
	tt = 0
	for (p, t) in zip(ps, ts):
		tt += t
		s = p - c * tt
		if s > 0:
			s1 += s
	s2 = 0
	tt = 0
	for (p, t) in zip(reversed(ps), reversed(ts)):
		tt += t
		s = p - c * tt
		if s > 0:
			s2 += s
	if s1 == s2:
		return 'Tie'
	elif s1 > s2:
		return 'Limak'
	else:
		return 'Radewoosh'

def main():
	(n, c) = list(map(int, input().split()))
	ps = list(map(int, input().split()))
	ts = list(map(int, input().split()))
	print(solve(c, ps, ts))
main()


(n, c) = input().split()
(n, c) = (int(n), int(c))
l = r = w = e = 0
p = [int(s) for s in input().split()]
t = [int(s) for s in input().split()]
for i in range(n):
	q = p[i] - c * t[i] - c * w
	w += t[i]
	a = p[n - 1 - i] - c * t[n - 1 - i] - c * e
	e += t[n - 1 - i]
	l += (abs(q) + q) // 2
	r += (abs(a) + a) // 2
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
z = s = 0
k = s1 = 0
a = []
b = []
for i in range(0, n):
	z = z + t[i]
	if c * z < p[i]:
		s = p[i] - c * z
		a.append(s)
for j in range(len(p) - 1, -1, -1):
	k = k + t[j]
	if c * k < p[j]:
		s1 = p[j] - c * k
		b.append(s1)
if sum(a) > sum(b):
	print('Limak')
elif sum(b) > sum(a):
	print('Radewoosh')
else:
	print('Tie')


def main():
	(n, c) = map(int, input().split())
	pp = list(map(int, input().split()))
	tt = list(map(int, input().split()))
	Limak = Radewoosh = start = 0
	stop = sum(tt)
	for (p, t) in zip(pp, tt):
		start += t
		Limak += max(0, p - c * start)
		Radewoosh += max(0, p - c * stop)
		stop -= t
	print('Limak' if Limak > Radewoosh else 'Radewoosh' if Limak < Radewoosh else 'Tie')
main()


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def I():
	return int(sys.stdin.readline())

def LS():
	return sys.stdin.readline().split()

def S():
	return input()

def main():
	(n, k) = LI()
	l1 = LI()
	l2 = LI()
	a = b = 0
	t = 0
	for i in range(n):
		t += l2[i]
		a += max(0, l1[i] - k * t)
	t = 0
	for i in range(n)[::-1]:
		t += l2[i]
		b += max(0, l1[i] - k * t)
	if a > b:
		return 'Limak'
	elif a < b:
		return 'Radewoosh'
	else:
		return 'Tie'
print(main())


(t1, t2) = (0, 0)
(n, c) = map(int, input().split())
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
(c1, c2) = (0, 0)
for i in range(n):
	t1 += l2[i]
	c1 += max(0, l1[i] - c * t1)
for i in range(n - 1, -1, -1):
	t2 += l2[i]
	c2 += max(0, l1[i] - c * t2)
if c1 == c2:
	print('Tie')
elif c1 > c2:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
(pointsl, pointsr) = (0, 0)
(timel, timer) = (0, 0)
for i in range(n):
	timel += t[i]
	timer += t[-i - 1]
	pointsl += max(0, p[i] - c * timel)
	pointsr += max(0, p[-i - 1] - c * timer)
if pointsl > pointsr:
	print('Limak')
elif pointsl < pointsr:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = list(map(int, input().split()))
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak_score = radewoosh_score = 0
time = 0
for i in range(n):
	time += t[i]
	limak_score += max(0, p[i] - c * time)
time = 0
for j in range(n - 1, -1, -1):
	time += t[j]
	radewoosh_score += max(0, p[j] - c * time)
if limak_score < radewoosh_score:
	print('Radewoosh')
elif limak_score > radewoosh_score:
	print('Limak')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
res = s = 0
for i in range(n):
	s = s + t[i]
	res = res + max(0, p[i] - s * c)
ans = s = 0
for i in reversed(range(n)):
	s = s + t[i]
	ans = ans + max(0, p[i] - s * c)
if ans < res:
	print('Limak')
elif ans > res:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split(' '))
problems = list(map(int, input().split(' ')))
times = list(map(int, input().split(' ')))
time1 = 0
time2 = 0
score1 = 0
score2 = 0
for i in range(n):
	time1 += times[i]
	time2 += times[n - i - 1]
	score1 += max(0, problems[i] - c * time1)
	score2 += max(0, problems[n - 1 - i] - c * time2)
if score1 > score2:
	print('Limak')
elif score1 < score2:
	print('Radewoosh')
else:
	print('Tie')


import os
import sys
from io import BytesIO, IOBase
import math
from decimal import Decimal
from decimal import *
from collections import defaultdict, deque
import heapq
from decimal import Decimal
getcontext().prec = 25
abcd = 'abcdefghijklmnopqrstuvwxyz'
ABCD = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
months = {1: 31, 2: 28, 3: 31, 4: 30, 5: 31, 6: 30, 7: 31, 8: 31, 9: 30, 10: 31, 11: 30, 12: 31}
MOD = 1000000007
BUFSIZE = 8192
from bisect import bisect_left, bisect_right

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
(n, m) = map(int, input().split(' '))
p = list(map(int, input().split(' ')))
t = list(map(int, input().split(' ')))
t1 = t2 = 0
ans1 = ans2 = 0
for i in range(n):
	t1 += t[i]
	t2 += t[n - i - 1]
	ans1 += max(0, p[i] - m * t1)
	ans2 += max(0, p[n - 1 - i] - m * t2)
if ans1 > ans2:
	print('Limak')
elif ans2 > ans1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
points = list(map(int, input().split()))
times = list(map(int, input().split()))
partialsum1 = [0] * n
partialsum1[0] = times[0]
partialsum2 = [0] * n
partialsum2[0] = times[n - 1]
for i in range(1, n):
	partialsum1[i] = partialsum1[i - 1] + times[i]
for i in range(1, n):
	partialsum2[i] = partialsum2[i - 1] + times[n - 1 - i]
Limak = 0
Radewoosh = 0
for i in range(n):
	Limak += max(0, points[i] - c * partialsum1[i])
	Radewoosh += max(0, points[n - i - 1] - c * partialsum2[i])
if Limak > Radewoosh:
	print('Limak')
elif Radewoosh > Limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
(k, s) = (0, 0)
for i in range(n):
	s += t[i]
	k += max(0, p[i] - c * s)
s = l = 0
for i in range(n)[::-1]:
	l += t[i]
	s += max(0, p[i] - c * l)
if k > s:
	print('Limak')
	exit()
if k < s:
	print('Radewoosh')
	exit()
print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
l = 0
r = 0
e = 0
y = 0
for i in range(n):
	e += t[i]
	if p[i] - c * e > 0:
		l += p[i] - c * e
	else:
		l += 0
for i in range(n - 1, -1, -1):
	y += t[i]
	if p[i] - c * y > 0:
		r += p[i] - c * y
	else:
		r += 0
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = map(int, input().split())
ls_1 = [*map(int, input().split())]
ls_2 = [*map(int, input().split())]
cnt_1 = sum((max(0, ls_1[i] - b * sum(ls_2[:i + 1])) for i in range(a)))
cnt_2 = sum((max(0, ls_1[i] - b * sum(ls_2[i:])) for i in range(a - 1, -1, -1)))
print('Tie' if cnt_1 == cnt_2 else ['Radewoosh', 'Limak'][cnt_1 > cnt_2])


import sys
import math
import itertools as it
import operator as op
(n, c) = list(map(int, sys.stdin.readline().split()))
P = list(map(int, sys.stdin.readline().split()))
T = list(map(int, sys.stdin.readline().split()))
tl = tr = sl = sr = 0
for i in range(n):
	tl += T[i]
	tr += T[n - 1 - i]
	sl += max(0, P[i] - c * tl)
	sr += max(0, P[n - 1 - i] - c * tr)
if sl > sr:
	print('Limak')
elif sl == sr:
	print('Tie')
else:
	print('Radewoosh')


[n, c] = [int(x) for x in input().split()]
P = [int(x) for x in input().split()]
T = [int(x) for x in input().split()]
L = tL = R = tR = 0
for i in range(n):
	tL += T[i]
	L += max(0, P[i] - c * tL)
	tR += T[-i - 1]
	R += max(0, P[-i - 1] - c * tR)
print('Limak' if L > R else 'Radewoosh' if L < R else 'Tie')


(n, c) = map(int, input().split())
l = list(map(int, input().split()))
t = list(map(int, input().split()))
u = t[::-1]
for i in range(1, n):
	(t[i], u[i]) = (t[i] + t[i - 1], u[i] + u[i - 1])
pl = 0
ql = 0
for i in range(n):
	if l[i] >= c * t[i]:
		pl += t[i] * c
	else:
		pl += l[i]
	if l[n - 1 - i] >= c * u[i]:
		ql += u[i] * c
	else:
		ql += l[n - 1 - i]
if pl < ql:
	print('Limak')
elif pl > ql:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
l_t = 0
l_m = 0
for i in range(n):
	l_t += t[i]
	l_m += max(p[i] - c * l_t, 0)
r_t = 0
r_m = 0
for i in range(n - 1, -1, -1):
	r_t += t[i]
	r_m += max(p[i] - c * r_t, 0)
if l_m > r_m:
	print('Limak')
elif l_m < r_m:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
a = u = 0
for (x, y) in zip(p, t):
	u += y
	a += max(0, x - c * u)
b = u = 0
p.reverse()
t.reverse()
for (x, y) in zip(p, t):
	u += y
	b += max(0, x - c * u)
if a > b:
	print('Limak')
elif a < b:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
scores = list(map(int, input().split()))
time = list(map(int, input().split()))
lim = 0
tot_time = 0
for (s, t) in zip(scores, time):
	tot_time += t
	lim += max(0, s - c * tot_time)
rad = 0
tot_time = 0
for (s, t) in zip(reversed(scores), reversed(time)):
	tot_time += t
	rad += max(0, s - c * tot_time)
if lim > rad:
	print('Limak')
elif lim < rad:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
s1 = 0
s2 = 0
for (i, j) in zip(range(n), range(n)):
	s1 += max(0, p[i] - sum(t[:i + 1]) * c)
	s2 += max(0, p[j] - sum(t[j:]) * c)
if s1 == s2:
	print('Tie')
else:
	print('Limak' if s1 > s2 else 'Radewoosh')


def max1(a):
	p = a[0]
	for x in a:
		if x > p:
			p = x
	return p

def prlist(a):
	for x in a:
		print(x, end=' ')
(n, c) = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
k1 = 0
t1 = 0
k2 = 0
t2 = 0
for i in range(n):
	t1 += b[i]
	if a[i] - t1 * c > 0:
		k1 += a[i] - t1 * c
for i in range(n - 1, -1, -1):
	t2 += b[i]
	if a[i] - t2 * c > 0:
		k2 += a[i] - t2 * c
if k1 > k2:
	print('Limak')
elif k2 > k1:
	print('Radewoosh')
else:
	print('Tie')


def first():
	inp = input().split(' ')
	n = int(inp[0])
	c = int(inp[1])
	p = []
	t = []
	ip = input().split(' ')
	for i in ip:
		p.append(int(i))
	it = input().split(' ')
	for i in it:
		t.append(int(i))
	(fs, ft) = (0, 0)
	(ss, st) = (0, 0)
	for i in range(n):
		ft += t[i]
		fs += max(0, p[i] - c * ft)
		st += t[n - i - 1]
		ss += max(0, p[n - i - 1] - c * st)
	if fs > ss:
		print('Limak')
	elif ss > fs:
		print('Radewoosh')
	else:
		print('Tie')
first()


(n, c) = map(int, input().split())
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
a = 0
s1 = 0
s2 = 0
for i in range(n):
	a += t[i]
	s1 += max(0, p[i] - a * c)
a = 0
for i in reversed(range(n)):
	a += t[i]
	s2 += max(0, p[i] - a * c)
if s1 > s2:
	print('Limak')
elif s1 < s2:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().strip().split()[:2])
prob = list(map(int, input().strip().split()[:n]))
time = list(map(int, input().strip().split()[:n]))
t1 = t2 = s1 = s2 = 0
for x in range(n):
	t1 = t1 + time[x]
	l1 = max(0, prob[x] - c * t1)
	s1 += l1
for x in range(n - 1, -1, -1):
	t2 = t2 + time[x]
	l2 = max(0, prob[x] - c * t2)
	s2 += l2
if s1 > s2:
	print('Limak')
elif s2 > s1:
	print('Radewoosh')
else:
	print('Tie')


import math
(n, c) = list(map(int, input().split()))
p = list(map(int, input().split()))
t = list(map(int, input().split()))
sum1 = []
sum2 = []
sum = 0
t2 = []
for i in range(n):
	sum = sum + t[i]
	t2.append(sum)
sum = 0
for i in range(n):
	sum = sum + p[i] - c * t2[i]
	if sum >= 0:
		sum1.append(sum)
	sum = 0
t2 = []
p.reverse()
t.reverse()
for i in range(n):
	sum = sum + t[i]
	t2.append(sum)
sum = 0
for i in range(n):
	sum = sum + p[i] - c * t2[i]
	if sum >= 0:
		sum2.append(sum)
	sum = 0
sum = 0
for i in range(len(sum1)):
	sum = sum + sum1[i]
mm = sum
sum = 0
for i in range(len(sum2)):
	sum = sum + sum2[i]
mm2 = sum
sum = 0
if mm > mm2:
	print('Limak')
elif mm < mm2:
	print('Radewoosh')
elif mm == mm2:
	print('Tie')


(n, c) = map(int, input().split(' '))
parr = list(map(int, input().split(' ')))
tarr = list(map(int, input().split(' ')))
(a, b) = (0, 0)
(at, bt) = (0, sum(tarr))
for (p, t) in zip(parr, tarr):
	a = a + max([p - (at + t) * c, 0])
	b = b + max([p - bt * c, 0])
	(at, bt) = (at + t, bt - t)
if a > b:
	print('Limak')
elif a < b:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
x = input()
y = input()
a = list(x.split())
b = list(y.split())
t = 0
k = 0
s = 0
s1 = 0
for i in range(n):
	t = int(b[i]) + t
	k = int(b[n - i - 1]) + k
	o = int(a[i]) - c * t
	p = int(a[n - i - 1]) - c * k
	if o < 0:
		o = 0
	if p < 0:
		p = 0
	s = s + o
	s1 = s1 + p
if s > s1:
	print('Limak')
if s1 > s:
	print('Radewoosh')
if s1 == s:
	print('Tie')


(m, n) = map(int, input().split())
c = 0
d = 0
x = 0
y = 0
p = list(map(int, input().split()))
q = list(map(int, input().split()))
for i in range(m):
	x += q[i]
	y += q[m - i - 1]
	c += max(0, p[i] - n * x)
	d += max(0, p[m - 1 - i] - n * y)
if c > d:
	print('Limak')
elif d > c:
	print('Radewoosh')
else:
	print('Tie')


l = list(map(int, input().split()))
n = l[0]
c = l[1]
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
s_l = 0
s_r = 0
t = 0
for i in range(n):
	if i > 0:
		t = 0
		x = i
		while x >= 0:
			t = t + l2[x]
			x = x - 1
	else:
		t = l2[0]
	a = l1[i] - t * c
	if a > 0:
		s_l = s_l + a
	else:
		s_l = s_l
t = 0
for i in range(n - 1, -1, -1):
	if i == n - 1:
		t = l2[i]
	else:
		x = i
		t = 0
		while x < n:
			t = t + l2[x]
			x = x + 1
	a = l1[i] - t * c
	if a > 0:
		s_r = s_r + a
	else:
		s_r = s_r
if s_r > s_l:
	print('Radewoosh')
elif s_l > s_r:
	print('Limak')
else:
	print('Tie')


from math import *
from copy import *
from string import *
from random import *
from sys import stdin
from sys import maxsize
from operator import *
from itertools import *
from collections import Counter
import math

def bin1(l, r, k, t, b, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		v = k ** mid
		if v == val:
			return v
		elif v > val:
			ans = mid
			return bin1(mid + 1, r, k, t, b, val, ans)
		else:
			return bin1(l, mid - 1, k, t, b, val, ans)

def bin2(l, r, k, t, b, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		v = t * k ** mid + b * mid
		if v == val:
			return v
		elif v > val:
			ans = mid
			return bin2(l, mid - 1, k, t, b, val, ans)
		else:
			return bin2(mid + 1, r, k, t, b, val, ans)

def SieveOfEratosthenes(n):
	prime = [True for i in range(n + 1)]
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	l = []
	for i in range(2, n + 1):
		if prime[i]:
			l.append(i)
	return l

def bin(l, r, ll, val):
	if l > r:
		return -1
	else:
		mid = (l + r) // 2
		if val >= ll[mid][0] and val <= ll[mid][1]:
			return mid
		elif val < ll[mid][0]:
			return bin(l, mid - 1, ll, val)
		else:
			return bin(mid + 1, r, ll, val)

def deci(n):
	s = ''
	while n != 0:
		if n % 2 == 0:
			n = n // 2
			s = '0' + s
		else:
			n = n // 2
			s = '1' + s
	return s

def diff(s1, s2):
	if len(s1) < len(s2):
		v = len(s1)
		while v != len(s2):
			s1 = '0' + s1
			v = v + 1
	else:
		v = len(s2)
		while v != len(s1):
			s2 = '0' + s2
			v = v + 1
	c = 0
	for i in range(len(s1)):
		if s1[i:i + 1] != s2[i:i + 1]:
			c = c + 1
	return c
from sys import stdin, stdout

def fac(a, b):
	v = a
	while a != b:
		v *= a - 1
		a = a - 1
	return v

def bino(l, r, n):
	if l > r:
		return -1
	else:
		mid = (l + r) // 2
		val1 = math.log(n / mid + 1, 2)
		val2 = int(val1)
		if val1 == val2:
			return val1
		elif val1 < 1.0:
			return bino(l, mid - 1, n)
		else:
			return bino(mid + 1, r, n)

def binary(l, r, ll, val, ans):
	if l > r:
		return ans
	else:
		mid = (l + r) // 2
		if ll[mid] == val:
			return ll[mid]
		elif ll[mid] < val:
			ans = ll[mid]
			return binary(mid + 1, r, ll, val, ans)
		else:
			return binary(l, mid - 1, ll, val, ans)

def check(n):
	v = 1
	while n != 0:
		if n % 10 == 0 or n % 10 == 1:
			n = n // 10
		else:
			v = 0
			break
	return v
(n, c) = map(int, input().split(' '))
p = list(map(int, input().split(' ')))
t = list(map(int, input().split(' ')))
score1 = 0
score2 = 0
x1 = 0
x2 = 0
for i in range(n):
	x1 += t[i]
	x2 += t[n - i - 1]
	score1 += max(0, p[i] - c * x1)
	score2 += max(0, p[n - i - 1] - c * x2)
if score1 > score2:
	print('Limak')
elif score2 > score1:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
sum1 = 0
sum2 = 0
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
for i in range(n):
	sum1 += max(0, p[i] - sum(t[:i + 1]) * c)
p.reverse()
t.reverse()
for i in range(n):
	sum2 += max(0, p[i] - sum(t[:i + 1]) * c)
if sum1 > sum2:
	print('Limak')
elif sum1 < sum2:
	print('Radewoosh')
else:
	print('Tie')


s = input()
s = s.split()
n = int(s[0])
c = int(s[1])
p = input()
p = p.split()
p = [int(i) for i in p]
t = input()
t = t.split()
t = [int(i) for i in t]
l = 0
r = 0
y = 0
for i in range(n):
	y += t[i]
	m = max(0, p[i] - y * c)
	l += m
y = 0
i = n - 1
while i >= 0:
	y += t[i]
	m = max(0, p[i] - y * c)
	r += m
	i -= 1
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


import sys
import math
import bisect

def query_score(n, c, P, T):
	ans = 0
	t = 0
	for i in range(n):
		t += T[i]
		ans += max([0, P[i] - c * t])
	return ans

def main():
	(n, c) = map(int, input().split())
	P = list(map(int, input().split()))
	T = list(map(int, input().split()))
	s1 = query_score(n, c, P, T)
	s2 = query_score(n, c, P[::-1], T[::-1])
	if s1 > s2:
		print('Limak')
	elif s1 < s2:
		print('Radewoosh')
	else:
		print('Tie')
main()


(n, c) = [int(x) for x in input().split()]
p = list(map(int, input().split()))
t = list(map(int, input().split()))
s1 = 0
s2 = 0
f = 0
g = 0
for i in range(n):
	f += t[i]
	g += t[n - i - 1]
	s1 += max(0, p[i] - c * f)
	s2 += max(0, p[n - i - 1] - c * g)
if s1 > s2:
	print('Limak')
elif s2 > s1:
	print('Radewoosh')
else:
	print('Tie')


s = [int(i) for i in input().split(' ')]
n = s[0]
c = s[1]
t = 0
l = 0
t1 = 0
t2 = 0
r = 0
p = [int(n) for n in input().split(' ')]
t = [int(n) for n in input().split(' ')]
for i in range(n):
	t1 += t[i]
	l += max(0, p[i] - c * t1)
	t2 += t[n - i - 1]
	r += max(0, p[n - i - 1] - c * t2)
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(x) for x in input().split(' ')]
ps = [int(x) for x in input().split(' ')]
ts = [int(x) for x in input().split(' ')]
l = 0
r = 0
tm1 = 0
tm2 = 0
for i in range(n):
	tm1 += ts[i]
	tm2 += ts[n - i - 1]
	l += max(0, ps[i] - c * tm1)
	r += max(0, ps[n - i - 1] - c * tm2)
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


(q, cheapening) = map(int, input().split())
tasks = map(int, input().split())
times = map(int, input().split())
tasks_times = list(zip(tasks, times))

def score_counting(tasks_times):
	score = 0
	total_time = 0
	for (task, time) in tasks_times:
		total_time += time
		score += max(task - total_time * cheapening, 0)
	return score
limak = score_counting(tasks_times)
radewoosh = score_counting(reversed(tasks_times))
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))

def point(debut, fin, pas):
	b = 0
	a = 0
	for i in range(debut, fin, pas):
		a += t[i]
		b += max(0, p[i] - a * c)
	return b
l_point = point(0, n, 1)
if n == 1:
	r_points = point(0, n, 1)
else:
	r_points = point(n - 1, 0, -1)
if l_point > r_points:
	print('Limak')
elif l_point < r_points:
	print('Radewoosh')
else:
	print('Tie')


def contest():
	(n, c) = list(map(int, input().split()))
	p = list(map(int, input().split()))
	t = list(map(int, input().split()))
	lScore = 0
	rScore = 0
	totalTime = 0
	for i in range(n):
		totalTime += t[i]
		lScore += max(0, p[i] - totalTime * c)
	totalTime = 0
	for j in range(n - 1, -1, -1):
		totalTime += t[j]
		rScore += max(0, p[j] - totalTime * c)
	if lScore > rScore:
		print('Limak')
	elif lScore < rScore:
		print('Radewoosh')
	else:
		print('Tie')
contest()


i = input
Limak = 0
Radewoosh = 0
Su = 0
(n, c) = map(int, i().split())
a = [*map(int, i().split())]
b = [*map(int, i().split())]
for j in range(n):
	Su += b[j]
	q = a[j] - c * Su
	if q > 0:
		Limak += q
Su = 0
for j in range(n - 1, -1, -1):
	Su += b[j]
	q = a[j] - c * Su
	if q > 0:
		Radewoosh += q
if Limak < Radewoosh:
	print('Radewoosh')
elif Limak > Radewoosh:
	print('Limak')
else:
	print('Tie')


(n, c) = list(map(int, input().split()))
p = list(map(int, input().split()))
t = list(map(int, input().split()))
sum_l = 0
sum_r = 0
t_l = 0
t_r = 0
for i in range(n):
	t_l += t[i]
	sum_l += max(0, p[i] - t_l * c)
p.reverse()
t.reverse()
for i in range(n):
	t_r += t[i]
	sum_r += max(0, p[i] - t_r * c)
if sum_l > sum_r:
	print('Limak')
elif sum_l < sum_r:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
r1 = 0
r2 = 0
time = 0
for i in range(n):
	time += t[i]
	k = p[i] - time * c
	if k > 0:
		r1 += k
time = 0
for i in range(n - 1, -1, -1):
	time += t[i]
	k = p[i] - time * c
	if k > 0:
		r2 += k
if r1 > r2:
	print('Limak')
elif r1 < r2:
	print('Radewoosh')
else:
	print('Tie')


global n, c, price, times
(n, c) = [int(x) for x in input().strip().split(' ')]
price = tuple((int(x) for x in input().strip().split(' ')))
times = tuple((int(x) for x in input().strip().split(' ')))

def current_price(p_i, current_time):
	return max(0, p_i - c * current_time)

def limak():
	limak_count = 0
	c_time = 0
	for i in range(n):
		c_time += times[i]
		limak_count += current_price(price[i], c_time)
	return limak_count

def radewoosh():
	radewoosh_count = 0
	c_time = 0
	for i in range(n)[::-1]:
		c_time += times[i]
		radewoosh_count += current_price(price[i], c_time)
	return radewoosh_count
radewoosh_ = radewoosh()
limak_ = limak()
if radewoosh_ == limak_:
	print('Tie')
elif radewoosh_ < limak_:
	print('Limak')
else:
	print('Radewoosh')


a = input().split()
n = int(a[0])
c = int(a[1])
p = input().split()
t = input().split()
t1 = 0
t2 = 0
p1 = 0
p2 = 0
for i in range(n):
	t1 += int(t[i])
	x = int(p[i]) - t1 * c
	if x > 0:
		p1 += x
	t2 += int(t[n - i - 1])
	x = int(p[n - i - 1]) - t2 * c
	if x > 0:
		p2 += x
if p1 > p2:
	print('Limak')
elif p1 == p2:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
ques = list(map(int, input().split()))
time = list(map(int, input().split()))
(sum1, sum2, D, C) = (0, 0, 0, 0)
for i in range(n):
	sum1 = sum1 + time[i]
	sum2 = sum2 + time[n - 1 - i]
	if ques[i] - c * sum1 > 0:
		D += ques[i] - c * sum1
	if ques[n - 1 - i] - c * sum2 > 0:
		C += ques[n - i - 1] - c * sum2
if D == C:
	print('Tie')
elif D > C:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
(L, T) = (0, 0)
for i in range(n):
	T += t[i]
	L += max(0, p[i] - c * T)
(R, T) = (0, 0)
for i in range(n)[::-1]:
	T += t[i]
	R += max(0, p[i] - c * T)
if L > R:
	print('Limak')
if L == R:
	print('Tie')
if L < R:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
bar = ['Limak', 'Tie', 'Radewoosh']
s1 = 0
t1 = 0
s2 = 0
t2 = 0
for i in range(n):
	t1 += t[i]
	t2 += t[n - i - 1]
	s1 += max(0, p[i] - t1 * c)
	s2 += max(0, p[n - i - 1] - t2 * c)
if s1 > s2:
	print(bar[0])
elif s1 < s2:
	print(bar[2])
else:
	print(bar[1])


s1 = list(map(int, input().split()))
n = s1[0]
c = s1[1]
p = list(map(int, input().split()))
t = list(map(int, input().split()))
l = 0
r = 0
i = 0
t1 = 0
while i < n:
	t1 = t1 + t[i]
	l = l + max(0, p[i] - c * t1)
	i = i + 1
i = n - 1
t2 = 0
while i >= 0:
	t2 = t2 + t[i]
	r = r + max(0, p[i] - c * t2)
	i = i - 1
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
d = a[::-1]
e = b[::-1]
t = 0
s = 0
limak_points = 0
radewoosh_points = 0
for (x, y) in zip(a, b):
	t = t + y
	p = x - t * c
	if p < 0:
		p = 0
	limak_points = limak_points + p
for (x, y) in zip(d, e):
	s = s + y
	q = x - s * c
	if q < 0:
		q = 0
	radewoosh_points = radewoosh_points + q
if limak_points > radewoosh_points:
	print('Limak')
elif limak_points < radewoosh_points:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]

def pointsForLimak(n, c, p, t):
	pointsSoFar = 0
	minutesBefore = 0
	for i in range(0, n):
		minutesTaken = t[i]
		subtractions = c * (minutesTaken + minutesBefore)
		pointsAvailableForCurrentProblem = p[i]
		pointswon = pointsAvailableForCurrentProblem - subtractions
		if pointswon < 0:
			pointswon = 0
		pointsSoFar = pointsSoFar + pointswon
		minutesBefore = minutesBefore + minutesTaken
	return pointsSoFar

def pointsForRadewoosh(n, c, p, t):
	pointsSoFar = 0
	minutesBefore = 0
	for i in range(n - 1, -1, -1):
		minutesTaken = t[i]
		subtractions = c * (minutesTaken + minutesBefore)
		pointsAvailableForCurrentProblem = p[i]
		pointswon = pointsAvailableForCurrentProblem - subtractions
		if pointswon < 0:
			pointswon = 0
		pointsSoFar = pointsSoFar + pointswon
		minutesBefore = minutesBefore + minutesTaken
	return pointsSoFar
limak = pointsForLimak(n, c, p, t)
radewoosh = pointsForRadewoosh(n, c, p, t)
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
elif limak == radewoosh:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
lim_score = 0
lim_penalty = 0
for i in range(n):
	lim_penalty += t[i]
	lim_score += max(0, p[i] - lim_penalty * c)
rad_score = 0
rad_penalty = 0
for i in range(n - 1, -1, -1):
	rad_penalty += t[i]
	rad_score += max(0, p[i] - rad_penalty * c)
if lim_score == rad_score:
	print('Tie')
elif lim_score > rad_score:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = input().split()
l = list(map(int, input().split()))
t = list(map(int, input().split()))
n = int(n)
c = int(c)
score_l = 0
score_r = 0
time_l = 0
time_r = 0
j = 0
for i in range(n):
	time_l = time_l + t[i]
	time_r = time_r + t[n - i - 1]
	score_l = score_l + max(0, l[j] - c * time_l)
	score_r = score_r + max(0, l[n - j - 1] - c * time_r)
	j = j + 1
if score_l > score_r:
	print('Limak')
elif score_r > score_l:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
t.append(0)
sc1 = sc2 = 0
for i in range(n):
	sc1 += max(0, p[i] - c * sum(t[:i + 1]))
	sc2 += max(0, p[n - i - 1] - c * sum(t[n - i - 1:]))
print('Limak' if sc1 > sc2 else 'Radewoosh' if sc1 < sc2 else 'Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
for i in range(n):
	p.append(input)
	t.append(input)
a = 0
b = 0
x = 0
y = 0
for i in range(n):
	x += t[i]
	a += max(0, p[i] - c * x)
for i in range(n - 1, -1, -1):
	y += t[i]
	b += max(0, p[i] - c * y)
if a > b:
	print('Limak')
elif a < b:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
arr = list(map(int, input().split()))
t = list(map(int, input().split()))
x = 0
point1 = 0
for i in range(n):
	x += t[i]
	point1 += max(arr[i] - c * x, 0)
x = 0
point2 = 0
for i in range(n - 1, -1, -1):
	x += t[i]
	point2 += max(arr[i] - c * x, 0)
if point1 > point2:
	print('Limak')
elif point2 == point1:
	print('Tie')
else:
	print('Radewoosh')


def topper(n, c, sc, tm):
	s1 = 0
	s2 = 0
	s = 0
	for i in range(n):
		s = s + tm[i]
		k = sc[i] - c * s
		s1 = s1 + max(0, k)
	n = n - 1
	s = 0
	while n >= 0:
		s = s + tm[n]
		k = sc[n] - c * s
		s2 = s2 + max(0, k)
		n = n - 1
	if s1 > s2:
		return 'Limak'
	elif s1 < s2:
		return 'Radewoosh'
	else:
		return 'Tie'
(n, c) = input().split()
n = int(n)
c = int(c)
sc = [int(i) for i in input().split()]
tm = [int(i) for i in input().split()]
print(topper(n, c, sc, tm))


def solution(l1, l2, l3):
	(limak, rade) = (0, 0)
	(l1r, l2r, l3r) = (l1.copy(), l2.copy(), l3.copy())
	l2r.reverse()
	l3r.reverse()
	i = 0
	t = 0
	ans = 0
	while i < len(l3):
		t += l3[i]
		l2[i] -= t * l1[1]
		l2[i] = max(0, l2[i])
		limak += l2[i]
		i += 1
	t = 0
	i = 0
	while i < len(l3r):
		t += l3r[i]
		l2r[i] -= t * l1r[1]
		l2r[i] = max(0, l2r[i])
		rade += l2r[i]
		i += 1
	if limak == rade:
		print('Tie')
	elif limak > rade:
		print('Limak')
	else:
		print('Radewoosh')

def answer():
	l1 = [int(x) for x in input().split()]
	l2 = [int(x) for x in input().split()]
	l3 = [int(x) for x in input().split()]
	solution(l1, l2, l3)
answer()


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
rt = 0
lt = 0
pl = 0
pr = 0
tl = 0
for i in range(n):
	pl += max(0, p[i] - c * (tl + t[i]))
	tl += t[i]
tl = 0
for i in range(n)[::-1]:
	pr += max(0, p[i] - c * (tl + t[i]))
	tl += t[i]
if pr > pl:
	print('Radewoosh')
elif pr == pl:
	print('Tie')
else:
	print('Limak')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
sum1 = 0
sum2 = 0
for i in range(n):
	sum1 += t[i]
	w = max(0, p[i] - c * sum1)
	sum2 += w
sum1 = 0
sum3 = 0
for j in range(n - 1, -1, -1):
	sum1 += t[j]
	p[j] = max(0, p[j] - c * sum1)
	sum3 += p[j]
if sum2 > sum3:
	print('Limak')
elif sum2 == sum3:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
(l, r) = (0, 0)
p = list(map(int, input().split()))
t = list(map(int, input().split()))
x1 = 0
p1 = sorted(p, reverse=True)
t1 = sorted(t, reverse=True)
x2 = 0
for i in range(n):
	x1 += t[i]
	l += max(0, p[i] - c * x1)
	x2 += t1[i]
	r += max(0, p1[i] - c * x2)
if l > r:
	print('Limak')
elif l < r:
	print('Radewoosh')
else:
	print('Tie')


def Input():
	return list(map(int, input().split()))
(n, c) = Input()
p = Input()
t = Input()
tm = 0
limak = 0
for i in range(len(p)):
	tm += t[i]
	limak += max(0, p[i] - c * tm)
p.reverse()
t.reverse()
tm = 0
radewoosh = 0
for i in range(len(p)):
	tm += t[i]
	radewoosh += max(0, p[i] - c * tm)
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
p_R = sorted(p, reverse=True)
t = list(map(int, input().split()))
t_R = sorted(t, reverse=True)
count_L = 0
count_R = 0
for i in range(n):
	if p[i] - c * sum(t[:i + 1]) > 0:
		count_L += p[i] - c * sum(t[:i + 1])
	if p_R[i] - c * sum(t_R[:i + 1]) > 0:
		count_R += p_R[i] - c * sum(t_R[:i + 1])
if count_L > count_R:
	print('Limak')
elif count_L < count_R:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
t_o = [t[0]]
for i in range(1, len(t)):
	t_o.append(t_o[-1] + t[i])
t_p = [t[-1]]
for i in range(len(t) - 2, -1, -1):
	t_p.append(t_p[-1] + t[i])
rade = 0
lima = 0
for i in range(len(p)):
	lima += max(0, p[i] - t_o[i] * c)
p.reverse()
for i in range(len(p)):
	rade += max(0, p[i] - t_p[i] * c)
if rade > lima:
	print('Radewoosh')
elif rade == lima:
	print('Tie')
else:
	print('Limak')


(n, c) = map(int, input().split())
(x, y) = (0, 0)
limak = [int(_) for _ in input().split()]
limak_time = [int(_) for _ in input().split()]
radewoosh = limak[::-1]
radewoosh_time = limak_time[::-1]
for i in range(n):
	x += limak_time[i]
	limak[i] = max(0, limak[i] - c * x)
	y += radewoosh_time[i]
	radewoosh[i] = max(0, radewoosh[i] - c * y)
if sum(limak) > sum(radewoosh):
	print('Limak')
elif sum(limak) == sum(radewoosh):
	print('Tie')
else:
	print('Radewoosh')


(a, b) = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
s = 0
d = 0
for i in range(len(x)):
	d = d + y[i]
	c = x[i] - d * b
	s = s + max(0, c)
	c = 0
x.reverse()
y.reverse()
z = 0
g = 0
for j in range(len(x)):
	g = g + y[j]
	t = x[j] - g * b
	z = z + max(0, t)
	t = 0
if s > z:
	print('Limak')
elif s < z:
	print('Radewoosh')
else:
	print('Tie')


(m, n) = list(map(int, input().split(' ')))
l1 = list(map(int, input().split(' ')))
l2 = list(map(int, input().split(' ')))
k1 = 0
t = 0
k2 = 0
for i in range(m):
	t = t + l2[i]
	c = l1[i] - n * t
	if c > 0:
		k1 = k1 + c
i = m - 1
t = 0
while i >= 0:
	t = t + l2[i]
	c = l1[i] - n * t
	if c > 0:
		k2 = k2 + c
	i = i - 1
if k1 > k2:
	print('Limak')
elif k1 < k2:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = map(int, input().split())
s = [int(x) for x in input().split()]
q = [int(x) for x in input().split()]
x1 = 0
x2 = 0
t1 = 0
t2 = 0
for i in range(a):
	t1 += q[i]
	t2 += q[a - 1 - i]
	x1 += max(s[i] - t1 * b, 0)
	x2 += max(s[a - 1 - i] - t2 * b, 0)
if x1 > x2:
	print('Limak')
elif x1 < x2:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
Ltotal = 0
Rtotal = 0
totalT1 = 0
totalT2 = 0
for i in range(0, n):
	totalT1 = totalT1 + t[i]
	Ltotal = Ltotal + max(0, p[i] - c * totalT1)
	totalT2 = totalT2 + t[n - i - 1]
	Rtotal = Rtotal + max(0, p[n - i - 1] - c * totalT2)
if Ltotal < Rtotal:
	print('Radewoosh')
elif Ltotal > Rtotal:
	print('Limak')
else:
	print('Tie')


(n, c) = map(int, input().split())
ps = map(int, input().split())
ts = map(int, input().split())
ordered = sorted(zip(ps, ts))
limak = 0
tt = 0
for (p, t) in ordered:
	tt += t
	limak += max(0, p - c * tt)
radewoosh = 0
cc = 0
tt = 0
for (p, t) in ordered[::-1]:
	tt += t
	radewoosh += max(0, p - c * tt)
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
else:
	print('Tie')


def func(a):
	for i in range(len(a)):
		if i != 0:
			a[i] = a[i] + a[i - 1]
	return a
(n, m) = map(int, input().split())
a = list(map(int, input().split()))
a.reverse()
d = []
for i in range(len(a)):
	d.append(a[i])
a.reverse()
b = list(map(int, input().split()))
b.reverse()
c = []
for i in b:
	c.append(i)
b.reverse()
b = func(b)
c = func(c)
l = 0
r = 0
for i in range(n):
	l += max(a[i] - b[i] * m, 0)
	r += max(d[i] - c[i] * m, 0)
if l > r:
	print('Limak')
elif l == r:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = list(map(int, input().split()))
p = list(map(int, input().split()))
t = list(map(int, input().split()))
fi = 0
se = 0
ti = 0
for i in range(n):
	ti += t[i]
	fi += max(0, p[i] - c * ti)
ti = 0
for i in range(n - 1, -1, -1):
	ti += t[i]
	se += max(0, p[i] - c * ti)
ret = ['Limak', 'Radewoosh', 'Tie']
pos = 2
if fi > se:
	pos = 0
elif fi < se:
	pos = 1
print(ret[pos])


(n, c) = map(int, input().split())
p = [int(num) for num in input().split()]
t = [int(num) for num in input().split()]
p_l = 0
p_r = 0

def operation(k):
	if k == 0:
		return t[k]
	else:
		return t[k] + operation(k - 1)
for i in range(n):
	p_l = p_l + max(0, p[i] - operation(i) * c)
t.reverse()
p.reverse()
for i in range(n):
	p_r = p_r + max(0, p[i] - operation(i) * c)
if p_l > p_r:
	print('Limak')
elif p_l < p_r:
	print('Radewoosh')
else:
	print('Tie')


a = list(map(int, input().split()))
p = list(map(int, input().split()))
t = list(map(int, input().split()))

def solve(a, p, t):
	n = a[0]
	c = a[1]
	points_limak = 0
	points_radek = 0
	time = 0
	for i in range(0, len(p)):
		time += t[i]
		points_limak += max(0, p[i] - c * time)
	time = 0
	for j in reversed(range(0, len(p))):
		time += t[j]
		points_radek += max(0, p[j] - c * time)
	if points_radek > points_limak:
		print('Radewoosh')
	elif points_limak > points_radek:
		print('Limak')
	else:
		print('Tie')
solve(a, p, t)


(n, c) = map(int, input().split())
mat_p = list(map(int, input().split()))
mat_t = list(map(int, input().split()))
tot_l = 0
tot_r = 0
res_l = 0
res_r = 0
for i in range(n):
	res_l += mat_t[i]
	res_r += mat_t[n - 1 - i]
	tot_l += max(mat_p[i] - res_l * c, 0)
	tot_r += max(mat_p[n - 1 - i] - res_r * c, 0)
if tot_l == tot_r:
	print('Tie')
else:
	print('Limak' if tot_l > tot_r else 'Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
pf = []
pr = []
x = 0
for i in range(n):
	x += t[i]
	pf.append(max(0, p[i] - x * c))
c1 = sum(pf)
p.reverse()
t.reverse()
x = 0
for i in range(n):
	x += t[i]
	pr.append(max(0, p[i] - x * c))
c2 = sum(pr)
if c1 > c2:
	print('Limak')
elif c1 == c2:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
x = 0
y = 0
res = 0
for (i, j) in enumerate(p):
	res += c * t[i]
	x += max(0, j - res)
p = p[::-1]
t = t[::-1]
res = 0
for (i, j) in enumerate(p):
	res += c * t[i]
	y += max(0, j - res)
if x > y:
	print('Limak')
elif x == y:
	print('Tie')
else:
	print('Radewoosh')


f = lambda : map(int, input().split())
(n, c) = f()
sr = sl = 0
s = list(f())
t = list(f())
for i in range(n):
	sl += max(0, s[i] - c * sum(t[:i + 1]))
	sr += max(0, s[-1 - i] - c * sum(t[-1:-2 - i:-1]))
print('Limak' if sl > sr else ['Tie', 'Radewoosh'][sl < sr])


(n, s) = map(int, input().split())
h = list(map(int, input().split()))
t = list(map(int, input().split()))
l = 0
z = 0
for i in reversed(range(n)):
	z += max(0, h[i] - s * sum(t[i:]))
for i in range(n):
	l += max(0, h[i] - s * sum(t[:i + 1]))
if z == l:
	print('Tie')
elif z > l:
	print('Radewoosh')
else:
	print('Limak')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
l = 0
r = 0
x = 0
for i in range(n):
	x += q[i]
	l += max(0, p[i] - c * x)
y = 0
for j in range(n - 1, -1, -1):
	y += q[j]
	r += max(0, p[j] - c * y)
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


c = input()
p = input()
t = input()
c = c.split()
p = p.split()
t = t.split()
a = 0
b = 0
j = 0
for i in range(int(c[0])):
	j += int(t[i])
	a += max(0, int(p[i]) - int(c[1]) * j)
j = 0
for i in range(int(c[0]) - 1, -1, -1):
	j += int(t[i])
	b += max(0, int(p[i]) - int(c[1]) * j)
if a > b:
	print('Limak')
elif a < b:
	print('Radewoosh')
else:
	print('Tie')


nc = list(map(int, input().split()))
n = nc[0]
c = nc[1]
points = list(map(int, input().split()))
times = list(map(int, input().split()))
lPoints = 0
rPoints = 0
timeSpent = 0
for i in range(n):
	timeSpent += times[i]
	lPoints += max(0, points[i] - timeSpent * c)
timeSpent = 0
i = n - 1
while i >= 0:
	timeSpent += times[i]
	rPoints += max(0, points[i] - timeSpent * c)
	i -= 1
if rPoints > lPoints:
	print('Radewoosh')
elif lPoints > rPoints:
	print('Limak')
else:
	print('Tie')


from itertools import accumulate
(n, c) = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
t_p = list(accumulate(t))
t_s = list(accumulate(reversed(t)))
Limak = sum((max(0, p[i] - c * t_p[i]) for i in range(n)))
Radewoosh = sum((max(0, p[n - 1 - i] - c * t_s[i]) for i in range(n)))
if Limak > Radewoosh:
	print('Limak')
elif Limak < Radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
scorel = 0
j = 0
scorem = 0
if n != 1:
	for i in range(n):
		j += t[i]
		score = p[i] - c * j
		scorek = max(0, score)
		scorel += scorek
	j = 0
	for i in range(n - 1, 0, -1):
		j += t[i]
		score = p[i] - c * j
		scorek = max(0, score)
		scorem += scorek
	if scorel > scorem:
		print('Limak')
	elif scorel < scorem:
		print('Radewoosh')
	else:
		print('Tie')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
x = 0
count1 = 0
count2 = 0
for i in range(n):
	x += t[i]
	count1 += max(0, p[i] - x * c)
x = 0
p.reverse()
t.reverse()
for i in range(n):
	x += t[i]
	count2 += max(0, p[i] - x * c)
if count1 > count2:
	print('Limak')
elif count1 == count2:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
score = list(map(int, input().split()))
times = list(map(int, input().split()))
rS = 0
lS = 0
rT = 0
lT = 0
for i in range(n):
	rT += times[i]
	rS += max(0, score[i] - rT * c)
	lT += times[n - 1 - i]
	lS += max(0, score[n - 1 - i] - lT * c)
if rS < lS:
	print('Radewoosh')
elif lS < rS:
	print('Limak')
else:
	print('Tie')


(n, c) = map(int, input().split())
L1 = list(map(int, input().split()))
L2 = list(map(int, input().split()))
Limak = 0
Radewoosh = 0
time = 0
for i in range(n):
	time += L2[i]
	Limak += max(0, L1[i] - time * c)
L1 = L1[::-1]
L2 = L2[::-1]
time = 0
for i in range(n):
	time += L2[i]
	Radewoosh += max(0, L1[i] - time * c)
if Limak > Radewoosh:
	print('Limak')
elif Limak == Radewoosh:
	print('Tie')
else:
	print('Radewoosh')


x = y = R = L = 0
(n, c) = map(int, input().split())
Point = [int(x) for x in input().split()]
Time = [int(x) for x in input().split()]
for i in range(n):
	x += Time[i]
	L += max(Point[i] - c * x, 0)
Time.reverse()
Point.reverse()
for i in range(n):
	y += Time[i]
	R += max(Point[i] - c * y, 0)
print('Tie') if L == R else print('Radewoosh') if L < R else print('Limak')


def main():
	(n, m) = [int(v) for v in input().split()]
	point = [int(v) for v in input().split()]
	times = [int(v) for v in input().split()]
	c1 = 0
	for (i, p) in enumerate(point):
		c1 += max(0, p - m * (times[i] + (sum(times[0:i]) if i > 0 else 0)))
	c2 = 0
	for (i, p) in enumerate(reversed(point)):
		times2 = list(reversed(times))
		c2 += max(0, p - m * (times2[i] + (sum(times2[0:i]) if i > 0 else 0)))
	if c1 > c2:
		print('Limak')
	elif c2 > c1:
		print('Radewoosh')
	else:
		print('Tie')
main()


(n, c) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
r = [int(x) for x in input().split()]
(x, y) = (0, 0)
for i in range(len(r)):
	x += max(0, l[i] - sum(r[0:i + 1]) * c)
	y += max(0, l[len(r) - 1 - i] - sum(r[-1:-(i + 2):-1]) * c)
if x > y:
	print('Limak')
elif x < y:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(x) for x in input().split()]
p_i = [int(x) for x in input().split()]
t_i = [int(x) for x in input().split()]
pl = pr = 0
tl = tr = 0
for i in range(n):
	tl = tl + t_i[i]
	tr = tr + t_i[n - 1 - i]
	if p_i[i] - tl * c > 0:
		pl = pl + p_i[i] - tl * c
	if p_i[n - 1 - i] - tr * c > 0:
		pr = pr + p_i[n - 1 - i] - tr * c
if pl > pr:
	print('Limak')
elif pl == pr:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = (int(i) for i in input().split())
(c1, c2, c3, c4) = (0, 0, 0, 0)
l1 = [int(i) for i in input().split()]
l2 = [int(i) for i in input().split()]
for i in range(n):
	c3 += l2[i]
	c4 += l2[n - i - 1]
	c1 += max(0, l1[i] - c3 * c)
	c2 += max(0, l1[n - i - 1] - c4 * c)
if c1 > c2:
	print('Limak')
elif c1 < c2:
	print('Radewoosh')
else:
	print('Tie')


l = list(input().split())
n = int(l[0])
c = int(l[1])
points = list(input().split())
points = [int(i) for i in points]
time = list(input().split())
time = [int(i) for i in time]
sumtime = 0
limak = 0
redwoosh = 0
for i in range(n):
	sumtime += time[i]
	limak += max(0, points[i] - c * sumtime)
sumtime = 0
for i in range(n - 1, -1, -1):
	sumtime += time[i]
	redwoosh += max(points[i] - c * sumtime, 0)
if limak > redwoosh:
	print('Limak')
elif limak < redwoosh:
	print('Radewoosh')
else:
	print('Tie')


x = [int(i) for i in input().split()]
(n, c) = (x[0], x[1])
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
(L, R) = (0, 0)
(a, b) = (0, 0)
for i in range(n):
	a += t[i]
	L += max(0, p[i] - c * a)
for i in range(n - 1, -1, -1):
	b += t[i]
	R += max(0, p[i] - c * b)
if L > R:
	print('Limak')
elif L < R:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
ls = 0
lt = 0
rs = 0
rt = 0
for i in range(n):
	lt += t[i]
	ls += max(0, p[i] - c * lt)
for i in range(n - 1, -1, -1):
	rt += t[i]
	rs += max(0, p[i] - c * rt)
if ls > rs:
	print('Limak')
elif ls == rs:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
P = list(map(int, input().split()))
T = list(map(int, input().split()))
s1 = 0
s2 = 0
t1 = 0
t2 = 0
for i in range(n):
	t1 += T[i]
	s1 += max(0, P[i] - c * t1)
for i in range(1, n + 1):
	t2 += T[-i]
	s2 += max(0, P[-i] - c * t2)
if s1 > s2:
	print('Limak')
elif s1 < s2:
	print('Radewoosh')
else:
	print('Tie')


from copy import deepcopy
(n, c) = map(int, input().split())
l = list(map(int, input().split()))
r = deepcopy(l)
t1 = list(map(int, input().split()))
tl = int(0)
tr = int(0)
(pl, pr) = (tl, tr)
for i in range(n):
	tl += t1[i]
	tr += t1[n - 1 - i]
	l[i] = max(0, l[i] - c * tl)
	r[n - 1 - i] = max(0, r[n - 1 - i] - c * tr)
	pl += l[i]
	pr += r[n - 1 - i]
if pl > pr:
	print('Limak')
elif pl < pr:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limakp = radewooshp = 0
limakt = radewoosht = 0
for i in range(n):
	limakt += t[i]
	radewoosht += t[n - i - 1]
	limakp += max(p[i] - c * limakt, 0)
	radewooshp += max(p[n - i - 1] - c * radewoosht, 0)
if limakp > radewooshp:
	print('Limak')
elif limakp < radewooshp:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
lim = 0
road = 0
lt = 0
rt = 0
for i in range(len(p)):
	lt += t[i]
	lim += max(0, p[i] - c * lt)
p.reverse()
t.reverse()
for i in range(len(p)):
	rt += t[i]
	road += max(0, p[i] - c * rt)
if lim > road:
	print('Limak')
elif road > lim:
	print('Radewoosh')
else:
	print('Tie')


I = lambda : list(map(int, input().split()))
(n, c) = I()
p = I()
t = I()
cur1 = 0
cur2 = sum(t)
res1 = 0
res2 = 0
for i in range(n):
	cur1 += t[i]
	res1 += max(0, p[i] - cur1 * c)
	res2 += max(0, p[i] - cur2 * c)
	cur2 -= t[i]
if res1 > res2:
	print('Limak')
elif res2 > res1:
	print('Radewoosh')
else:
	print('Tie')


def solve(n, c, p, t):
	lim = 0
	limT = 0
	rade = 0
	radeT = 0
	for i in range(n):
		limT = limT + t[i]
		radeT = radeT + t[n - i - 1]
		lim += max(0, p[i] - c * limT)
		rade += max(0, p[n - i - 1] - c * radeT)
	if lim > rade:
		return 'Limak'
	if lim < rade:
		return 'Radewoosh'
	return 'Tie'
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
print(solve(n, c, p, t))


def ll():
	return list(map(int, input().split()))
s = ll()
first_list = []
reverse_list = []
second_list = []
reverse_second_list = []
temp = 0
count = 0
inc = 0
inc2 = 0
for i in range(1):
	n = ll()
	first_list = first_list + n
reverse_list = first_list[::-1]
for t in range(1):
	n = ll()
	second_list = second_list + n
reverse_second_list = second_list[::-1]
for j in range(len(first_list)):
	inc += second_list[j]
	inc2 += reverse_second_list[j]
	temp += max(0, first_list[j] - s[1] * inc)
	count += max(0, reverse_list[j] - s[1] * inc2)
if temp > count:
	print('Limak')
elif count > temp:
	print('Radewoosh')
else:
	print('Tie')


a = input()
b = a.split()
n = int(b[0])
c = int(b[1])
a = input()
b = a.split()
a = input()
t = a.split()
for i in range(len(b)):
	b[i] = int(b[i])
for i in range(len(t)):
	t[i] = int(t[i])
time = 0
coun_lew = 0
coun = 0
for i in range(n):
	time += t[i]
	coun = b[i] - c * time
	if coun <= 0:
		coun = 0
	coun_lew += coun
time = 0
coun_rew = 0
coun = 0
for i in range(n - 1, -1, -1):
	time += t[i]
	coun = b[i] - c * time
	if coun <= 0:
		coun = 0
	coun_rew += coun
if coun_lew > coun_rew:
	print('Limak')
elif coun_lew < coun_rew:
	print('Radewoosh')
else:
	print('Tie')


nc = input().split()
nc = [int(nc[i]) for i in range(2)]
p = input().split()
p = [int(p[i]) for i in range(nc[0])]
t = input().split()
t = [int(t[i]) for i in range(nc[0])]
limak = 0
radewoosh = 0
time = 0
for prob in range(nc[0]):
	time += t[prob]
	limak += max(0, p[prob] - nc[1] * time)
time = 0
for prob in range(nc[0] - 1, -1, -1):
	time += t[prob]
	radewoosh += max(0, p[prob] - nc[1] * time)
if limak > radewoosh:
	print('Limak')
elif limak < radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
times = [int(x) for x in input().split()]
(l, r, cur_t_1, cur_t_2) = (0, 0, 0, 0)
for i in range(0, a):
	(cur_t_1, cur_t_2) = (cur_t_1 + times[i], cur_t_2 + times[a - i - 1])
	(l, r) = (l + max(0, scores[i] - b * cur_t_1), r + max(0, scores[a - i - 1] - b * cur_t_2))
if l == r:
	print('Tie')
elif l > r:
	print('Limak')
else:
	print('Radewoosh')


(con, c) = map(int, input().split())
prob = list(map(int, input().split()))
t = list(map(int, input().split()))
lt = 0
rt = sum(t)
limak = reed = 0
for i in range(con):
	lt += t[i]
	limak += max(0, prob[i] - c * lt)
	reed += max(0, prob[i] - c * rt)
	rt -= t[i]
if limak > reed:
	print('Limak')
elif limak == reed:
	print('Tie')
else:
	print('Radewoosh')


constant = input()
constant = constant.split(' ')
constant = int(constant[-1])
Limak_points = 0
Radewoosh_points = 0
Limak_time = 0
Radewoosh_time = 0
old_points = input()
old_time = input()
old_points = old_points.split(' ')
old_time = old_time.split(' ')
points = []
time = []
for current_time in old_time:
	time.append(int(current_time))
for current_points in old_points:
	points.append(int(current_points))
for index in range(len(points)):
	Limak_time += time[index]
	Limak_points += max(0, points[index] - constant * Limak_time)
for index in range(len(points)):
	Radewoosh_time += time[-index - 1]
	Radewoosh_points += max(0, points[-index - 1] - constant * Radewoosh_time)
if Limak_points > Radewoosh_points:
	print('Limak')
elif Limak_points < Radewoosh_points:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
s = 0
sr = 0
for i in range(len(p)):
	s = s + max(0, p[i] - c * sum(t[:i + 1]))
p = p[::-1]
t = t[::-1]
for i in range(len(p)):
	sr = sr + max(0, p[i] - c * sum(t[:i + 1]))
if s > sr:
	print('Limak')
elif s < sr:
	print('Radewoosh')
else:
	print('Tie')


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = list(map(int, input().split()))
e = 0
(Limak_point, Radewoosh_point) = (0, 0)
for i in range(a):
	e += d[i]
	f = c[i] - b * e
	if f <= 0:
		Limak_point += 0
	else:
		Limak_point += f
e = 0
for j in range(a - 1, -1, -1):
	e += d[j]
	f = c[j] - b * e
	if f <= 0:
		Radewoosh_point += 0
	else:
		Radewoosh_point += f
if Limak_point > Radewoosh_point:
	print('Limak')
elif Limak_point < Radewoosh_point:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
(lp, rp) = (0, 0)
(lt, rt) = (0, 0)
for i in range(n):
	lt += t[i]
	e = p[i] - lt * c
	lp += max(e, 0)
for j in range(n - 1, -1, -1):
	rt += t[j]
	d = p[j] - rt * c
	rp += max(d, 0)
if lp > rp:
	print('Limak')
elif lp == rp:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
pi = list(map(int, input().split()))
ti = list(map(int, input().split()))
s = 0
for i in range(1, n + 1):
	lst = sum(ti[:i])
	a = pi[i - 1]
	maxm = max(0, a - c * lst)
	s += maxm
pi = pi[::-1]
ti = ti[::-1]
s1 = 0
for i in range(1, n + 1):
	lst = sum(ti[:i])
	a = pi[i - 1]
	maxm = max(0, a - c * lst)
	s1 += maxm
if s > s1:
	print('Limak')
elif s < s1:
	print('Radewoosh')
else:
	print('Tie')


string = input().split(' ')
n = int(string[0])
c = int(string[1])
scores = input().split(' ')
for i in range(n):
	scores[i] = int(scores[i])
timeTaken = input().split(' ')
for i in range(n):
	timeTaken[i] = int(timeTaken[i])
Limak = 0
runningTime = 0
for i in range(n):
	runningTime += timeTaken[i]
	Limak += max(0, scores[i] - c * runningTime)
Radewoosh = 0
runningTime = 0
for i in range(n - 1, -1, -1):
	runningTime += timeTaken[i]
	Radewoosh += max(0, scores[i] - c * runningTime)
if Limak > Radewoosh:
	print('Limak')
elif Radewoosh > Limak:
	print('Radewoosh')
else:
	print('Tie')


const = [int(n) for n in input().split()]
score = [int(const[0]) for const[0] in input().split()]
time = [int(const[0]) for const[0] in input().split()]
limaktotal = 0
limaktime = 0
radetotal = 0
radetime = 0
for i in range(len(score)):
	limaktime = limaktime + time[i]
	limaktotal = limaktotal + max(0, score[i] - int(const[1]) * limaktime)
	radetime = radetime + time[len(score) - i - 1]
	radetotal = radetotal + max(0, score[len(score) - i - 1] - int(const[1]) * radetime)
if limaktotal > radetotal:
	print('Limak')
elif radetotal > limaktotal:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(i) for i in input().strip().split(' ')]
p = [int(i) for i in input().strip().split(' ')]
t = [int(i) for i in input().strip().split(' ')]
l_pts = 0
r_pts = 0
l_cnt = 0
r_cnt = 0
for i in range(n):
	l_cnt += t[i]
	if p[i] - l_cnt * c > 0:
		l_pts += p[i] - l_cnt * c
	r_cnt += t[n - i - 1]
	if p[n - i - 1] - r_cnt * c > 0:
		r_pts += p[n - i - 1] - r_cnt * c
if l_pts > r_pts:
	print('Limak')
elif r_pts > l_pts:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split(' '))
p = list(map(int, input().split(' ')))
t = list(map(int, input().split(' ')))
(timel, timer, pointl, pointr) = (0, 0, 0, 0)
ln = len(p)
for i in range(ln):
	timel = timel + t[i]
	timer = timer + t[ln - 1 - i]
	pointl = pointl + (p[i] - c * timel if p[i] - c * timel > 0 else 0)
	pointr = pointr + (p[ln - 1 - i] - c * timer if p[ln - 1 - i] - c * timer > 0 else 0)
if pointl == pointr:
	print('Tie')
elif pointl > pointr:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
p = map(int, input().split())
t = map(int, input().split())
lP = list(p)
lT = list(t)
R = 0
L = 0
i = 0
sumt = 0
for i in range(n):
	sumt += lT[i]
	L += max(0, lP[i] - c * sumt)
i = n - 1
sumt = 0
while i >= 0:
	sumt += lT[i]
	R += max(0, lP[i] - c * sumt)
	i = i - 1
if L > R:
	print('Limak')
elif R > L:
	print('Radewoosh')
else:
	print('Tie')


a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
(i, j, cl, cr) = (0, a[0] - 1, 0, 0)
while i < a[0]:
	cl += max(0, b[i] - sum(c[:i + 1]) * a[1])
	cr += max(0, b[j] - sum(c[j:]) * a[1])
	(i, j) = (i + 1, j - 1)
if cl > cr:
	print('Limak')
elif cr > cl:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = (int(v) for v in input().split())
score = [int(u) for u in input().split()]
time = [int(t) for t in input().split()]
Limak = 0
Radewoosh = 0
tL = 0
tR = 0
for i in range(n):
	tL += time[i]
	Limak += max(0, score[i] - c * tL)
	tR += time[n - 1 - i]
	Radewoosh += max(0, score[n - 1 - i] - c * tR)
if Limak > Radewoosh:
	print('Limak')
elif Radewoosh > Limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(x) for x in input().split()]
t = []
u = []
x = 0
y = 0
for i in range(0, 1):
	t = [int(x) for x in input().split()]
for i in range(1, 2):
	u = [int(x) for x in input().split()]
z = []
s = []
for i in range(1, n + 1):
	z.append(sum(u[:i]))
for i in range(0, n):
	x += max(0, t[i] - z[i] * c)
u.reverse()
for i in range(1, n + 1):
	s.append(sum(u[:i]))
s.reverse()
for i in range(1, n + 1):
	y += max(0, t[-i] - s[-i] * c)
if x > y:
	print('Limak')
elif y > x:
	print('Radewoosh')
elif y == x:
	print('Tie')


(n, c) = map(int, input().split())
p = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
l = 0
r = 0
tl = 0
tr = 0
for i in range(n):
	tl += t[i]
	l += max(0, p[i] - c * tl)
if n == 1:
	tr = t[0]
	r = max(0, p[i] - c * tl)
else:
	for i in range(n - 1, 0, -1):
		tr += t[i]
		r += max(0, p[i] - c * tr)
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


a = list(map(int, input().split()))
b = [0, 0]
for i in range(0, 2):
	b[i] = list(map(int, input().split()))
st = 0
x = 0
for j in range(0, a[0]):
	x = x + b[1][j]
	st = st + max(0, b[0][j] - a[1] * x)
ed = 0
y = 0
for k in range(a[0] - 1, -1, -1):
	y = y + b[1][k]
	ed = ed + max(0, b[0][k] - a[1] * y)
if st > ed:
	print('Limak')
if st < ed:
	print('Radewoosh')
if st == ed:
	print('Tie')


(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
i = 0
l = 0
r = 0
x = 0
y = 0
while i < n:
	x += t[i]
	y += t[n - i - 1]
	l += max(0, p[i] - c * x)
	r += max(0, p[n - i - 1] - c * y)
	i += 1
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
k1 = k2 = 0
w1 = w2 = 0
for i in range(n):
	w1 += t[i]
	k1 += max(0, p[i] - c * w1)
for i in range(n - 1, -1, -1):
	w2 += t[i]
	k2 += max(0, p[i] - c * w2)
if k1 > k2:
	print('Limak')
elif k1 == k2:
	print('Tie')
else:
	print('Radewoosh')


(n, c) = [int(s) for s in input().split()]
p = [int(s) for s in input().split()]
t = [int(s) for s in input().split()]
(l_p, r_p, l_time, r_time) = (0, 0, 0, 0)
for i in range(n):
	l_time += t[i]
	r_time += t[-i - 1]
	l_p += max(0, p[i] - c * l_time)
	r_p += max(0, p[-i - 1] - c * r_time)
if l_p > r_p:
	print('Limak')
elif l_p < r_p:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
points = list(map(int, input().split()))
times = list(map(int, input().split()))

def total_points(points, time):
	s = 0
	t = 0
	for i in range(n):
		t += time[i]
		s += max(0, points[i] - c * t)
	return s
a = total_points(points, times)
b = total_points(points[::-1], times[::-1])
if a > b:
	print('Limak')
if a < b:
	print('Radewoosh')
if a == b:
	print('Tie')


IL = lambda : list(map(int, input().split()))
(n, c) = IL()
P = IL()
T = IL()
s1 = s2 = 0
for i in range(n):
	s1 += max(P[i] - c * sum(T[:i + 1]), 0)
	s2 += max(P[-(i + 1)] - c * sum(T[-(i + 1):]), 0)
print(['Tie', 'Limak', 'Radewoosh'][(s1 > s2) - (s2 > s1)])


def points(p, t, c):
	x = 0
	pts = 0
	for i in range(len(p)):
		x += t[i]
		pts += max(0, p[i] - c * x)
	return pts
(n, c) = map(int, input().split())
p = list(map(int, input().split()))
t = list(map(int, input().split()))
limak = points(p, t, c)
p.reverse()
t.reverse()
rade = points(p, t, c)
if limak == rade:
	print('Tie')
elif limak > rade:
	print('Limak')
else:
	print('Radewoosh')


(n, c) = map(int, input().split())
points = list(map(int, input().split()))
time = list(map(int, input().split()))
l = 0
r = 0
t1 = 0
t2 = 0
for i in range(n):
	t1 += time[i]
	t2 += time[n - 1 - i]
	l += max(0, points[i] - t1 * c)
	r += max(0, points[n - 1 - i] - t2 * c)
if l == r:
	print('Tie')
elif l > r:
	print('Limak')
else:
	print('Radewoosh')


i = lambda : map(int, input().split())
(n, c) = i()
p = [*i()]
t = [*i()]
(s, a, b) = (0, 0, 0)
for k in range(n):
	a += t[k]
	b += t[n - 1 - k]
	s += max(0, p[k] - a * c) - max(0, p[n - k - 1] - b * c)
print([['Tie', 'Radewoosh'][s < 0], 'Limak'][s > 0])


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
t = list(map(int, input().split()))
ns = len(l)
bs = 0
ts = 0
rs = 0
tp = 0
for i in range(ns):
	ts += t[i]
	tp += t[ns - i - 1]
	bs += max(0, l[i] - m * ts)
	rs += max(0, l[ns - i - 1] - m * tp)
if bs > rs:
	print('Limak')
elif bs < rs:
	print('Radewoosh')
else:
	print('Tie')


def solv(begin, end, step):
	global c, p, t
	time = 0
	point = 0
	for i in range(begin, end, step):
		time += t[i]
		point += max(0, p[i] - time * c)
	return point
(n, c) = map(int, input().split())
p = [int(x) for x in input().split()]
t = [int(x) for x in input().split()]
lim = solv(0, n, 1)
rad = solv(n - 1, -1, -1)
if lim > rad:
	print('Limak')
elif lim < rad:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
costs = list(map(int, input().split()))
times = list(map(int, input().split()))
limac = 0
time = 0
for i in range(len(times)):
	time += times[i]
	limac += max(0, costs[i] - c * time)
costs.reverse()
times.reverse()
Radewoosh = 0
time = 0
for i in range(len(times)):
	time += times[i]
	Radewoosh += max(0, costs[i] - c * time)
if limac > Radewoosh:
	print('Limak')
elif limac < Radewoosh:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
pi = list(map(int, input().split()))
ti = list(map(int, input().split()))
num1 = 0
num2 = 0
p2 = 0
p1 = 0
for i in range(n):
	p1 += ti[i]
	num1 += max(0, pi[i] - c * p1)
for i in range(n - 1, -1, -1):
	p2 += ti[i]
	num2 += max(0, pi[i] - c * p2)
if num1 < num2:
	print('Radewoosh')
elif num1 == num2:
	print('Tie')
else:
	print('Limak')


(n, c) = map(int, input().split())
P = list(map(int, input().split()))
T = list(map(int, input().split()))
Limak = 0
Pade = 0
SL = []
SP = []
sl = 0
sp = 0
for i in range(n):
	sl += T[i]
	sp += T[n - i - 1]
	SL.append(sl)
	SP.append(sp)
for i in range(n):
	Limak += max(0, P[i] - SL[i] * c)
	Pade += max(0, P[n - i - 1] - SP[i] * c)
if Limak > Pade:
	print('Limak')
elif Pade > Limak:
	print('Radewoosh')
else:
	print('Tie')


(n, c) = map(int, input().split())
s = list(map(int, input().split()))
s2 = list(map(int, input().split()))
lk = 0
m = 0
s1 = 0
for i in range(n):
	m += s2[i]
	s1 = s[i] - m * c
	if s1 >= 0:
		lk += s1
m = 0
s1 = 0
rd = 0
for i in range(n - 1, -1, -1):
	m += s2[i]
	s1 = s[i] - m * c
	if s1 >= 0:
		rd += s1
if rd > lk:
	print('Radewoosh')
elif lk > rd:
	print('Limak')
else:
	print('Tie')


(n, c) = map(int, input().split())
l = 0
r = 0
l1 = list(map(int, input().split()))
l2 = list(map(int, input().split()))
l3 = l2[::-1]
j = 0
k = -1
for i in l1:
	l += max(0, i - c * sum(l2[:j + 1]))
	r += max(0, l1[k] - c * sum(l3[:j + 1]))
	j += 1
	k -= 1
if l > r:
	print('Limak')
elif r > l:
	print('Radewoosh')
else:
	print('Tie')