#include <bits/stdc++.h>
int max(int a, int b) {
  if (a > b) return a;
  return b;
}
int main() {
  int n, c, l = 0, r = 0;
  scanf("%d %d", &n, &c);
  int p[n], t[n], lt[n], rt[n];
  for (int i = 0; i < n; i++) {
    scanf("%d", &p[i]);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &t[i]);
  }
  lt[0] = t[0];
  rt[n - 1] = t[n - 1];
  for (int i = 1; i < n; i++) {
    lt[i] = lt[i - 1] + t[i];
    rt[n - i - 1] = rt[n - i] + t[n - i - 1];
  }
  for (int i = 0; i < n; i++) {
    l += max(0, p[i] - (c * lt[i]));
    r += max(0, p[n - i - 1] - (c * rt[n - i - 1]));
  }
  if (l < r) {
    printf("Radewoosh\n");
  } else if (l == r) {
    printf("Tie\n");
  } else {
    printf("Limak\n");
  }
}
