#include <bits/stdc++.h>
int a[55], b[55];
int n, c;
long long mul1() {
  int time = 0;
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    time += b[i];
    if (a[i] - c * time > 0) sum += a[i] - c * time;
  }
  return sum;
}
long long mul2() {
  int time = 0;
  long long sum = 0;
  for (int i = n - 1; i >= 0; i--) {
    time += b[i];
    if (a[i] - c * time > 0) sum += a[i] - c * time;
  }
  return sum;
}
int main() {
  scanf("%d%d", &n, &c);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  for (int i = 0; i < n; i++) scanf("%d", &b[i]);
  long long a = mul1();
  long long b = mul2();
  if (a > b)
    printf("Limak\n");
  else if (a < b)
    printf("Radewoosh\n");
  else
    printf("Tie\n");
  return 0;
}
