#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int arr[100010];
int sg[100010];
int main() {
  int pos, i, tmp;
  bool win = false;
  memset(sg, 0, sizeof sg);
  scanf("%d%d%d", &n, &m, &k);
  if (n % 2 == 0)
    win = false;
  else {
    tmp = m;
    for (i = 2; i * i <= m; i++)
      if (m / i * i == m) {
        tmp = i;
        break;
      }
    if (m / k < tmp || (tmp == m && k != 1) || (tmp == 1))
      win = false;
    else
      win = true;
  }
  printf("%s\n", win == true ? "Timur" : "Marsel");
}
