#include <bits/stdc++.h>   using namespace std;   vector<int> p;   vector<int> t;   int main() {     int n, c, a, ans1 = 0, ans2 = 0, t1 = 0, t2 = 0;     cin >> n >> c;     for (int i = 0; i < n * 2; i++) {       cin >> a;       if (i < n) {         p.push_back(a);       } else {         t.push_back(a);       }     }     for (int i = 0; i < p.size(); i++) {       t1 += t[i];       ans1 += max(0, p[i] - c * t1);     }     for (int i = n - 1; i >= 0; i--) {       t2 += t[i];       ans2 += max(0, p[i] - c * t2);     }     if (ans1 > ans2)       cout <<  Limak ;     else if (ans2 > ans1)       cout <<  Radewoosh ;     else       cout <<  Tie ;     return 0;   }   