#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> mem;
int k;
bool solve(int n, int m) {
  if (n > 1) return (n & 1) & solve(1, m);
  if (mem.count(m) > 0) return mem[m];
  bool ans = true;
  for (int i = 1; i * i <= m; i++) {
    if (m % i == 0) {
      if (i >= k && (m / i) != 1) {
        ans &= solve(m / i, i);
      }
      if ((m / i) != i && (m / i) >= k && i != 1) {
        ans &= solve(i, m / i);
      }
    }
  }
  mem[m] = !ans;
  return !ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m >> k;
  if (solve(n, m))
    cout << "Timur\n";
  else
    cout << "Marsel\n";
  return 0;
}
