#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
map<int, bool> dp[2][2];
map<int, bool> used[2][2];
void getWin(bool& res, int lose, int win, int c, int g) {
  if (lose && win) {
    res = g;
  } else if (win && c) {
    res = g;
  } else if (lose && !c) {
    res = g;
  }
}
int win(int g, int c, int d) {
  bool& res = dp[g][c][d];
  if (used[g][c][d]) {
    return res;
  }
  used[g][c][d] = 1;
  res = !g;
  if (!c) {
    return res;
  }
  int lastd = max(4, (int)sqrt(d));
  int loseFlag, winFlag;
  for (int i = 1; i <= lastd; ++i) {
    if (d % i) {
      continue;
    }
    int d1 = d / i;
    int c1 = i;
    int d2 = i;
    int c2 = d / i;
    if (d1 >= k && c1 > 1) {
      loseFlag = (win(!g, c1 & 1, d1) == !g);
      winFlag = (win(!g, c1 & 1, d1) == g);
      getWin(res, loseFlag, winFlag, c, g);
    }
    if (d2 >= k && c2 > 1) {
      loseFlag = (win(!g, c2 & 1, d2) == !g);
      winFlag = (win(!g, c2 & 1, d2) == g);
      getWin(res, loseFlag, winFlag, c, g);
    }
  }
  return res;
}
void solve() {
  cin >> n >> m >> k;
  cout << (win(0, n % 2, m) == 0 ? "Timur" : "Marsel");
}
int main() {
  ios_base::sync_with_stdio(false);
  solve();
  return 0;
}
