#include <bits/stdc++.h>
using namespace std;
int k;
map<int, int> calc;
int nim(int n) {
  if (calc.find(n) != calc.end()) return calc[n];
  if (n == 1) return 0;
  bool fl[110];
  memset(fl, 0, sizeof(fl));
  for (int i = 2; i * i <= n; i++) {
    if (n % i != 0) continue;
    if (n / i >= k)
      if (i % 2 == 0)
        fl[0] = true;
      else
        fl[nim(n / i)] = true;
    if (i >= k)
      if ((n / i) % 2 == 0)
        fl[0] = true;
      else
        fl[nim(i)] = true;
  }
  if (k == 1) {
    if (n % 2 == 0)
      fl[0] = true;
    else
      fl[nim(1)] = true;
  }
  for (int i = 0;; i++)
    if (!fl[i]) return calc[n] = i;
}
int main() {
  int n, m;
  scanf("%d %d %d", &n, &m, &k);
  if (n % 2 == 0)
    printf("Marsel");
  else if (nim(m) > 0)
    printf("Timur");
  else
    printf("Marsel");
  return 0;
}
