Bear and Reverse Radewoosh（水）

Bear and Reverse Radewoosh

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

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₁, p₂, ..., p_n (1 ≤ p_i ≤ 1000, p_i < p_i + 1) — initial scores.

The third line contains n integers t₁, t₂, ..., t_n (1 ≤ t_i ≤ 1000, t_i < t_i + 1) where t_i denotes the number of minutes one needs to solve thei-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.

Sample Input

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

Hint

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

1. Limak spends 10 minutes on the 1-st problem and he gets 50 - c·10 = 50 - 2·10 = 30 points.
2. 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.
3. 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 gets250 - 2·50 = 150 points.

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

Radewoosh solves problem in the reversed order:

1. Radewoosh solves 3-rd problem after 25 minutes so he gets 250 - 2·25 = 200 points.
2. 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.
3. 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 the8-th problem. They won't get points for other problems and thus there is a tie because 2 + 2 = 4.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

#include
#include
#include
using namespace std;
int main()
{
	int n,c;
	while(~scanf("%d%d",&n,&c))
	{
		int point[1010],sore[1010],time[1010],point1[1010];
		memset(point,0,sizeof(point));
		memset(point1,0,sizeof(point1));
		for(int i=1;i<=n;i++)
		scanf("%d",&sore[i]);
		for(int i=1;i<=n;i++)
		scanf("%d",&time[i]);
		int p=0,num=0;
		for(int i=1;i<=n;)
		{
			p=p+time[i];
			point[num++]=max(0,sore[i]-p*c);
			i++;
		}
		int sum1=0;
		for(int i=0;i<num;i++)
	    sum1+=point[i];
	    int s=0,num1=0;
	    for(int i=n;i>=1;)
	    {
	    	s=s+time[i];
			point1[num1++]=max(0,sore[i]-s*c);
			i--;
		}
		int sum2=0;
		for(int i=0;i<num1;i++)
		sum2+=point1[i];
		if(sum1>sum2)
		printf("Limak\n");
		else if(sum1==sum2)
		printf("Tie\n");
		else printf("Radewoosh\n");
	}
	
	return 0;
}