#include <bits/stdc++.h>
int N, p[51], t[51], C, S1, S2;
int main() {
  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, g = 0; i <= N; i++) S1 += std::max(0, p[i] - C * (g += t[i]));
  for (int i = N, g = 0; i; i--) S2 += std::max(0, p[i] - C * (g += t[i]));
  puts(S1 > S2 ? "Limak" : (S1 < S2 ? "Radewoosh" : "Tie"));
  return 0;
}
