#include <bits/stdc++.h>
using namespace std;
int n, m, k;
map<int, bool> mp;
bool gr(int x) {
  if (k == 1 && m != 1) return true;
  if (mp.count(x)) return mp[x];
  bool ans = false;
  int d = sqrt(x + 0.0);
  for (int i = 2; i <= d; i++) {
    if (x % i) continue;
    if (i >= k) ans |= !gr(i);
    if (x / i >= k) ans |= !gr(x / i);
  }
  return mp[x] = ans;
}
int main() {
  cin >> n >> m >> k;
  bool f = true;
  bool x = gr(m);
  if (x && n % 2)
    cout << "Timur";
  else
    cout << "Marsel";
  return 0;
}
