#include <bits/stdc++.h>
using namespace std;
int n, c, li = 0, re = 0, p[100], t[100], mx = 0;
int main() {
  cin >> n >> c;
  for (int i = 0; i < n; i++) cin >> p[i];
  for (int i = 0; i < n; i++) cin >> t[i];
  mx = t[0];
  for (int i = 0; i < n; i++) {
    li += max(0, (p[i] - (c * mx)));
    mx += t[i + 1];
  }
  mx = t[n - 1];
  for (int i = n - 1; i >= 0; i--) {
    re += max(0, (p[i] - (c * mx)));
    mx += t[i - 1];
  }
  if (li == re)
    cout << "Tie" << endl;
  else if (li > re)
    cout << "Limak" << endl;
  else
    cout << "Radewoosh" << endl;
  return 0;
}
