#include <iostream>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
if (n%2==0) {cout << "Marsel"; return 0;}
for (int i=1; i*i<=m; i++) {
if (m%i==0) {
if (i>=k && i!=m) {cout << "Timur"; return 0;}
if ((m/i)>=k && (m/i)!=m) {cout << "Timur"; return 0;}
}
}
cout << "Marsel";
return 0;
}/*1689718675.8371506*/
714B - Filya and Homework | 31A - Worms Evolution |
1691A - Beat The Odds | 433B - Kuriyama Mirai's Stones |
892A - Greed | 32A - Reconnaissance |
1236D - Alice and the Doll | 1207B - Square Filling |
1676D - X-Sum | 1679A - AvtoBus |
1549A - Gregor and Cryptography | 918C - The Monster |
4B - Before an Exam | 545B - Equidistant String |
1244C - The Football Season | 1696B - NIT Destroys the Universe |
1674A - Number Transformation | 1244E - Minimizing Difference |
1688A - Cirno's Perfect Bitmasks Classroom | 219A - k-String |
952A - Quirky Quantifiers | 451B - Sort the Array |
1505H - L BREAK into program | 171E - MYSTERIOUS LANGUAGE |
630D - Hexagons | 1690D - Black and White Stripe |
1688D - The Enchanted Forest | 1674C - Infinite Replacement |
712A - Memory and Crow | 1676C - Most Similar Words |