1 1 1
1000000000
2 1
 20 2 15
12698951 55128070 116962690 156763505 188535242 194018601 269939893 428710623 442819431 483000923 516768937 552903993 633087286 656092270 671535141 714291344 717660646 846508634 879748146 937368929
2 7
1 2
2 4
1 19
1 12
1 5
2 18
2 11
1 16
2 1
2 3
2 19
1 17
2 9
2 6
 6 3 10
62417580 78150524 410053501 582708235 630200761 760672946
2 2
1 5
1 2
1 4
2 4
2 1
2 1
1 6
2 5
2 6

NO
 NO
NO
NO
NO
NO
NO
YES
NO
NO
 NO
YES
NO
NO
YES
YES

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		//BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
	//	StringTokenizer st = new StringTokenizer(f.readLine());
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int c = sc.nextInt();
		int p[] = new int[n];
		int t[] = new int[n];
		int pre[] = new int[n+1];
		int post[] = new int[n+1];
		for(int i = 0;i<n;i++){
			p[i]=sc.nextInt();
		}
		for(int i = 0;i<n;i++){
			t[i]=sc.nextInt();
		}
		pre[0]=0;
		for(int i = 1;i<=n;i++){
			pre[i]=pre[i-1]+t[i-1];
		}
		post[0]=0;
		for(int i =1;i<=n;i++){
			post[i]=post[i-1]+t[n-i];
		}
		int ans1 = 0;
		int ans2 = 0;
		for(int i = 0;i<n;i++){
			ans1+=Math.max(0,p[i]-c*pre[i+1]);
			ans2+=Math.max(0,p[n-i-1]-c*post[i+1]);
		}
		if(ans1>ans2){
			System.out.println("Limak");
		}
		if(ans1<ans2){
			System.out.println("Radewoosh");
		}
		if(ans1==ans2){
			System.out.println("Tie");
		}
	}
}