#include <bits/stdc++.h>
using namespace std;
const long long MAX = 2500000000;
const int inf = 123456789;
const double EPS = 1e-9;
const double PI = 2 * asin(1.0);
const long long mod = 1e9 + 7;
int double_cmp(double x, double y = 0, double tol = EPS) {
  return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
int pontos[100], tempo[100];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; ++i) scanf("%d", &pontos[i]);
  for (int i = 0; i < n; ++i) scanf("%d", &tempo[i]);
  int t = 0;
  int a = 0, b = 0;
  for (int i = 0; i < n; ++i) {
    t += tempo[i];
    a += max(0, (pontos[i] - t * m));
  }
  t = 0;
  for (int i = n - 1; i >= 0; --i) {
    t += tempo[i];
    b += max(0, (pontos[i] - t * m));
  }
  if (a > b)
    printf("Limak\n");
  else if (b > a)
    printf("Radewoosh\n");
  else
    printf("Tie\n");
}
