#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, c, x = 0, lim = 0, rad = 0;
  int p[50], t[50], t1[50];
  cin >> n >> c;
  for (int i = 0; i < n; i++) cin >> p[i];
  for (int i = 0; i < n; i++) cin >> t[i];
  for (int i = n - 1; i >= 0; i--) t1[x++] = t[i];
  for (int i = 1; i < n; i++) t[i] += t[i - 1];
  for (int i = 1; i < n; i++) t1[i] += t1[i - 1];
  for (int i = 0; i < n; i++) {
    if (p[i] - t[i] * c > 0) lim += (p[i] - t[i] * c);
    if (p[n - 1 - i] - t1[i] * c > 0) rad += (p[n - 1 - i] - t1[i] * c);
  }
  if (abs(lim) > abs(rad))
    cout << "Limak";
  else if (abs(lim) == abs(rad))
    cout << "Tie";
  else
    cout << "Radewoosh";
  return 0;
}
