#include <bits/stdc++.h>
const double pi = acos(-1.0);
const long long MAXN = 100;
using namespace std;
vector<pair<int, int>> a;
int n, c, s[MAXN], t[MAXN];
int sum1 = 0, sum2 = 0;
int main() {
  cin >> n >> c;
  for (int i = 0; i < n; i++) cin >> s[i];
  for (int i = 0; i < n; i++) cin >> t[i];
  for (int i = 0; i < n; i++) a.push_back(make_pair(s[i], t[i]));
  sort(a.begin(), a.end());
  int x = a[0].second;
  for (int i = 0; i < n; i++) {
    sum1 += max(0, a[i].first - c * x);
    if (i + 1 < n) x += a[i + 1].second;
  }
  x = a[n - 1].second;
  for (int i = n - 1; i >= 0; i--) {
    sum2 += max(0, a[i].first - c * x);
    if (i - 1 >= 0) x += a[i - 1].second;
  }
  if (sum1 == sum2)
    cout << "Tie" << endl;
  else if (sum1 > sum2)
    cout << "Limak" << endl;
  else
    cout << "Radewoosh" << endl;
  return 0;
}
