#include <bits/stdc++.h>
using namespace std;
const int maxn = 55;
long long p[maxn];
long long t[maxn];
int main() {
  int n, c;
  cin >> n >> c;
  for (int i = 1; i <= n; i++) cin >> p[i];
  for (int i = 1; i <= n; i++) cin >> t[i];
  long long p1 = 0, p2 = 0;
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    sum += t[i];
    p1 = p1 + max(0LL, p[i] - c * sum);
  }
  sum = 0;
  for (int i = n; i >= 1; i--) {
    sum += t[i];
    p2 = p2 + max(0LL, p[i] - c * sum);
  }
  if (p1 > p2)
    cout << "Limak" << endl;
  else if (p2 > p1)
    cout << "Radewoosh" << endl;
  else
    cout << "Tie" << endl;
}
