#include <bits/stdc++.h>
using namespace std;
const int maxn = 10000000;
int m, n, k;
int a[maxn];
int t;
void Get() {
  memset(a, 0, sizeof(a));
  t = 0;
  for (int i = 1; i <= (int)sqrt(double(m)); i++) {
    if (m % i == 0) {
      t++;
      a[t] = i;
      if ((m / i) != i) {
        t++;
        a[t] = m / i;
      }
    }
  }
}
int main() {
  int i;
  bool flag;
  while (scanf("%d%d%d", &n, &m, &k) != EOF) {
    if (n % 2 == 0) {
      printf("Marsel\n");
      continue;
    }
    Get();
    flag = false;
    for (i = 1; i <= t; i++) {
      if (a[i] >= k && a[i] < m) {
        flag = true;
        break;
      }
    }
    if (flag == false)
      printf("Marsel\n");
    else
      printf("Timur\n");
  }
  return 0;
}
