#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:64000000")
using namespace std;
const double PI = 2 * acos(0.0);
const double EPS = 1e-8;
const int INF = 1000000000;
int n, m, k;
int g[1000001];
map<int, int> q;
int f(int m) {
  if (m <= 1000000 && g[m] >= 0) return g[m];
  if (m > 1000000 && q.find(m) != q.end()) return q[m];
  set<int> qq;
  for (int i = 1; i * i <= m; ++i)
    if (m % i == 0) {
      if (i > 1 && m / i >= k)
        if (i % 2 == 1)
          qq.insert(f(m / i));
        else
          qq.insert(0);
      if (i * i < m)
        if (m / i > 1 && i >= k)
          if ((m / i) % 2 == 1)
            qq.insert(f(i));
          else
            qq.insert(0);
    };
  int res = 0;
  while (qq.find(res) != qq.end()) ++res;
  if (m <= 1000000) g[m] = res;
  if (m > 1000000) q[m] = res;
  return res;
};
int main() {
  for (int i = (int)(0); i < (int)(1000001); ++i) g[i] = -1;
  cin >> n >> m >> k;
  if (n % 2 == 0) {
    printf("Marsel");
    return 0;
  };
  if (f(m))
    printf("Timur");
  else
    printf("Marsel");
  return 0;
};
