#include <bits/stdc++.h>
using namespace std;
map<int, int> dp;
int n, m, k;
int DP(int meter) {
  if (dp.count(meter)) return dp[meter];
  bool z = false;
  vector<int> mex;
  for (int d = 1; 1LL * d * d <= meter; ++d)
    if (meter % d == 0) {
      int p = d, q = meter / d;
      if (p > 1 && meter / p >= k) {
        if (p % 2 == 0) {
          z = true;
        } else
          mex.push_back(DP(meter / p));
      }
      if (q > 1 && meter / q >= k) {
        if (q % 2 == 0) {
          z = true;
        } else
          mex.push_back(DP(meter / q));
      }
    }
  if (z) mex.push_back(0);
  vector<int> cnt(mex.size() + 1, 0);
  for (int x : mex)
    if (0 <= x && x < mex.size() + 1) cnt[x]++;
  for (int i = 0; i < mex.size() + 1; ++i)
    if (cnt[i] == 0) return dp[meter] = i;
  assert(false);
}
int main() {
  cin >> n >> m >> k;
  if (n % 2 == 0)
    cout << "Marsel";
  else {
    int t = DP(m);
    if (t == 0)
      cout << "Marsel";
    else
      cout << "Timur";
  }
  return 0;
}
