#include <bits/stdc++.h>
using namespace std;
int k;
map<int, int> mem_dp;
vector<int> all_divs;
int dp(int m) {
  if (!mem_dp.count(m)) {
    vector<int> dpvals;
    for (int u : all_divs) {
      if (m % u == 0 && u != 1 && m / u >= k) {
        if (u % 2 == 0)
          dpvals.push_back(0);
        else
          dpvals.push_back(dp(m / u));
      }
    }
    sort(dpvals.begin(), dpvals.end());
    dpvals.resize(unique(dpvals.begin(), dpvals.end()) - dpvals.begin());
    int i;
    for (i = 0; i < (int)dpvals.size() && dpvals[i] == i; i++)
      ;
    mem_dp[m] = i;
  }
  return mem_dp[m];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m >> k;
  for (int i = 1; i * i <= m; i++) {
    if (m % i == 0) {
      all_divs.push_back(i);
      all_divs.push_back(m / i);
    }
  }
  if (n % 2 == 0 || dp(m) == 0)
    cout << "Marsel" << endl;
  else
    cout << "Timur" << endl;
  return 0;
}
