#include <bits/stdc++.h>
int p[1005];
int t[1005];
int nmax(int a, int b) {
  if (a > b)
    return a;
  else
    return b;
}
int main() {
  int n, c, i;
  long long s1 = 0, s2 = 0, t1 = 0, t2 = 0;
  scanf("%d%d", &n, &c);
  for (i = 0; i < n; i++) scanf("%d", &p[i]);
  for (i = 0; i < n; i++) scanf("%d", &t[i]);
  for (i = 0; i < n; i++) {
    t1 += t[i];
    s1 = s1 + nmax(0, p[i] - c * t1);
  }
  for (i = n - 1; i >= 0; i--) {
    t2 += t[i];
    s2 = s2 + nmax(0, p[i] - c * t2);
  }
  if (s1 > s2)
    printf("Limak");
  else if (s2 > s1)
    printf("Radewoosh");
  else
    printf("Tie");
  return 0;
}
