#include <bits/stdc++.h>
using namespace ::std;
const double pi = acos(-1.0);
const double eps = 1e-9;
int n, c, lim, rad;
vector<pair<int, int> > tasks;
int main() {
  cin >> n >> c;
  int z, s = 0;
  for (int i = 0; i < n; i++) {
    cin >> z;
    tasks.push_back(make_pair(z, 0));
  }
  int summ = 0;
  for (int i = 0; i < n; i++) {
    cin >> z;
    summ += z;
    tasks[i].second = summ;
  }
  for (int i = 0; i < n; i++) {
    lim += max(0, tasks[i].first - tasks[i].second * c);
    rad += max(
        0, tasks[i].first - (i > 0 ? summ - tasks[i - 1].second : summ) * c);
  }
  if (lim > rad)
    cout << "Limak";
  else if (rad > lim)
    cout << "Radewoosh";
  if (lim == rad) cout << "Tie";
}
