#include <bits/stdc++.h>
using namespace std;
struct problem {
  int p, t;
} pm[51];
int main() {
  int n, c;
  int point1 = 0, point2 = 0;
  int t1[51];
  int t2[51];
  scanf("%d%d", &n, &c);
  for (int i = 0; i < n; i++) {
    scanf("%d", &pm[i].p);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &pm[i].t);
    if (i >= 1)
      t1[i] = pm[i].t + t1[i - 1];
    else
      t1[i] = pm[i].t;
  }
  for (int i = n - 1; i >= 0; i--) {
    if (i < n - 1)
      t2[i] = pm[i].t + t2[i + 1];
    else
      t2[i] = pm[i].t;
  }
  for (int i = 0; i < n; i++) {
    if (pm[i].p - t1[i] * c > 0) point1 += pm[i].p - t1[i] * c;
  }
  for (int i = n - 1; i >= 0; i--) {
    if (pm[i].p - t2[i] * c > 0) point2 += pm[i].p - t2[i] * c;
  }
  if (point1 > point2)
    printf("Limak\n");
  else if (point1 < point2)
    printf("Radewoosh\n");
  else
    printf("Tie\n");
  return 0;
}
