#include <bits/stdc++.h>
using namespace std;
const int max_n = 55;
long long p[max_n], t[max_n];
int main() {
  long long i, j, n, c, ptr1, ptr2, tim = 0;
  cin >> n >> c;
  for (i = 0; i < n; ++i) {
    cin >> p[i];
  }
  for (i = 0; i < n; ++i) {
    cin >> t[i];
  }
  tim = ptr1 = 0;
  for (i = 0; i < n; ++i) {
    tim += t[i];
    ptr1 += max(0LL, p[i] - c * tim);
  }
  tim = ptr2 = 0;
  for (i = n - 1; i >= 0; --i) {
    tim += t[i];
    ptr2 += max(0LL, p[i] - c * tim);
  }
  if (ptr1 == ptr2) {
    printf("Tie\n");
  } else if (ptr1 > ptr2) {
    printf("Limak\n");
  } else {
    printf("Radewoosh\n");
  }
  return 0;
}
