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: interview

Starter code:

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

n,c = list(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, t = list(map(int, input().split())), list(map(int, input().split()))
t1, t2, p1, p2 = 0, 0, 0, 0
for i in range(n):
    t1 += t[i]
    p1 += max(0, p[i] - c * t1)
    t2 += t[n - i - 1]
    p2 += max(0, p[n - i - 1] - c * t2)
if p1 == p2:
    print('Tie')
else:
    print('Limak' if p1 > p2 else 'Radewoosh')

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")

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=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")


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
#split into two, test l and r separately
timeSpent = 0
for i in range(n):
    timeSpent += times[i]
    lPoints += max(0,(points[i]-(timeSpent*c)))
#do Radewoosh
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")

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 = 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")

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")

from sys import stdin as Si
from itertools import combinations_with_replacement as Cr
def __starting_point():
    n,c = list(map(int,Si.readline().split()))

    S = tuple(map(int,Si.readline().split()))   #score
    T = tuple(map(int,Si.readline().split()))   #time
    L,R=0,0
    for i in range(n):
        #print(S[i],sum(T[:i+1])*c,S[n-1-i],sum(T[n-1-i:])*c)
        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')
        
        

                  
                

'''
    A = input()
    stack = []      #Real Stack
    Graph = {
        ')':'('
        }
    count = 0
    def black(A):
        #p for possibility
        stak =[]
        for e in A:
            if e in ['(']:
                stak.append(e)
            else:
                if stak==[] or Graph[e]!=stak[-1]:
                    p=False
                else:
                    stak.pop(len(stak)-1)     #pop last 
        if len(stak) ==0:
            p=True
        else:
            p=False
        if not p:   return [0]
        else:
            #stak is not empty
            stak = []
            count = []
            for e in range(len(A)):
                if A[e]=='(' or stak==[]:  stak.append(A[e])
                else:
                    if A[e]==')' and Graph[A[e]]==stak[-1]:
                        while Graph[A[e]]==stak[-1]:
                            stak.pop(-1)
                            if e==len(A)-1: break
                            e+=1
                            if A[e]=='(' or stak==[]:   break
                        count.append(1)
            return count

    rov = []
    P = False 
    for e in A:
        if e in ['(']:  stack.append(e)
        else:
            if stack!=[]:
                stack.append(e)
                if stack.count('(')==stack.count(')'):
                    x=black(stack)
                    if x!=[0]:    P = True
                    if x==[1]:
                        rov.append(1)
                    else:
                        rov.append(sum(x[:-1]))
                    stack=[]
    if not P:   print(0)
    else:
        pro =1
        for i in rov:   pro*=i
        print(pro)
    
'''

__starting_point()

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

#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import time

#   = input()
#   = int(input())

#() = (i for i in input().split())
#   = [i for i in input().split()]

(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()
#print(finish - start)


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()

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=list(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")


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")

'__author__'=='deepak Singh Mehta'







def __starting_point():
    n,c = list(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))
        #print("aa-> ",rade)
    if limak>rade:
        print("Limak")
    elif limak<rade:
        print("Radewoosh")
    else:
        print("Tie")

__starting_point()

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")


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")

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

p_l, p_t = 0,0
for i in range(n):
    p_l += max(0, p[i] - c * sum(t[:i+1]))
    p_t += max(0, p[n - i - 1] - c * sum(t[n-i-1:]))
if p_l > p_t:
    print('Limak')
elif p_l == p_t:
    print('Tie')
else:
    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])

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')


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()