#include <bits/stdc++.h>
using namespace std;
int maxValue(int x, int y) { return x > y ? x : y; }
int Value(int p, int c, int x) { return p - (c * x); }
int main() {
  int n, c, p[1002], t[1002];
  scanf("%d%d", &n, &c);
  for (int i = 0; i < n; i++) {
    scanf("%d", &p[i]);
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &t[i]);
  }
  int Limak = 0, Radewoosh = 0, ltime = 0, rtime = 0;
  for (int i = 0; i < n; i++) {
    ltime = ltime + t[i];
    Limak = Limak + maxValue(0, Value(p[i], c, ltime));
    rtime = rtime + t[n - i - 1];
    Radewoosh = Radewoosh + maxValue(0, Value(p[n - i - 1], c, rtime));
  }
  if (Limak > Radewoosh)
    printf("Limak\n");
  else if (Limak < Radewoosh)
    printf("Radewoosh\n");
  else
    printf("Tie\n");
  return 0;
}
