#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
int t[100009], p[100009];
int main() {
  int n, c, tim = 0, a1 = 0, a2 = 0;
  scanf("%d%d", &n, &c);
  for (int i = 1; i <= n; i++) scanf("%d", p + i);
  for (int i = 1; i <= n; i++) scanf("%d", t + i);
  for (int i = 1; i <= n; i++) {
    tim += t[i];
    a1 += max(0, p[i] - tim * c);
  }
  tim = 0;
  for (int i = n; i >= 1; i--) {
    tim += t[i];
    a2 += max(0, p[i] - tim * c);
  }
  if (a1 > a2)
    printf("Limak\n");
  else if (a2 > a1)
    printf("Radewoosh\n");
  else
    printf("Tie\n");
  return 0;
}
