#include <bits/stdc++.h>
using namespace std;
const int INF = int(1e9);
const double EPS = 0.00000000001, PI = 3.14159265358979323846;
const int maxn = 1111;
int p[maxn], t[maxn];
int main() {
  int n, c;
  long long limak = 0, radewoosh = 0;
  scanf("%d%d", &n, &c);
  for (int i = 1; i <= n; ++i) scanf("%d", &p[i]);
  for (int i = 1; i <= n; ++i) scanf("%d", &t[i]);
  int time = 0;
  for (int i = 1; i <= n; ++i) {
    time += t[i];
    limak += max(0, p[i] - time * c);
  }
  time = 0;
  for (int i = n; i >= 1; --i) {
    time += t[i];
    radewoosh += max(0, p[i] - time * c);
  }
  if (limak == radewoosh)
    puts("Tie");
  else if (limak > radewoosh)
    puts("Limak");
  else
    puts("Radewoosh");
  cerr << endl << clock() << " ms";
  return 0;
}
