#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
vector<int> V;
LL d[100][2];
LL divprime(LL n) {
  LL i, count = 0, k = n;
  for (i = 2; i * i <= k; i++)
    if (n % i == 0) {
      d[count][0] = i;
      d[count][1] = 0;
      while (n % i == 0) n /= i, d[count][1]++;
      count++;
    }
  if (n > 1) d[count][0] = n, d[count][1] = 1, count++;
  return count;
}
void finddiv(LL ceng, LL ji, LL n, LL count) {
  if (ceng == count) {
    V.push_back(ji);
    return;
  }
  LL i, m;
  for (i = 0, m = 1; i <= d[ceng][1]; i++)
    finddiv(ceng + 1, ji * m, n, count), m *= d[ceng][0];
}
int dfs(int n, int m, int k) {
  int i, count = divprime(m);
  V.clear();
  finddiv(0, 1, m, count);
  sort(V.begin(), V.end());
  for (i = 0; i < (int)V.size(); i++)
    if (V[i] != m && V[i] >= k) return n + dfs(n * (m / V[i]), V[i], k);
  return 0;
}
int main(void) {
  int n, m, k, lun = 0;
  cin >> n >> m >> k;
  lun = dfs(n, m, k);
  if (lun % 2)
    cout << "Timur" << endl;
  else
    cout << "Marsel" << endl;
  return 0;
}
