#include <bits/stdc++.h>
using namespace std;
int main() {
  long int sum1, sum2, n, m, l, b, c, p[1001], t[1001], t1[10001], t2[1001];
  cin >> n >> c;
  {
    for (int i = 0; i < n; i++) {
      cin >> p[i];
    }
    for (int i = 0; i < n; i++) {
      cin >> t[i];
      t1[i] = t[i];
      t2[i] = t[i];
    }
    sum1 = l = 0;
    sum2 = b = 0;
    sum1 = sum1 + p[0] - c * t1[0];
    if (sum1 < 0) sum1 = 0;
    if (sum1 >= 0) {
      for (int i = 1; i < n; i++) {
        l = p[i] - c * (t1[i] + t1[i - 1]);
        if (l <= 0) l = 0;
        t1[i] = t1[i] + t1[i - 1];
        sum1 = sum1 + l;
      }
    } else
      sum1 = 0;
    sum2 = sum2 + p[n - 1] - c * t2[n - 1];
    if (sum2 < 0) sum2 = 0;
    if (sum2 >= 0) {
      for (int i = n - 2; i >= 0; i--) {
        b = p[i] - c * (t2[i] + t2[i + 1]);
        if (b <= 0) b = 0;
        t2[i] = t2[i] + t2[i + 1];
        sum2 = sum2 + b;
      }
    } else
      sum2 = 0;
    if (sum1 == sum2)
      cout << "Tie\n";
    else if (sum1 > sum2)
      cout << "Limak\n";
    else
      cout << "Radewoosh\n";
  }
  return 0;
}
