#include <bits/stdc++.h>
using namespace std;
long long const MAX = 1e5 + 10;
void solve() {
  int n, m, k;
  cin >> n >> m >> k;
  int sq = sqrt(m);
  bool flag = 0, prime = 0;
  for (int i = 2; i <= sq; i++) {
    if (m % i == 0) {
      if (m / i < k) {
        flag = 1;
      }
      break;
    }
    if (i == sq) prime = 1;
  }
  if (flag or (prime && k != 1) or m == 1 or (m == 2 && k != 1) or
      (m == 3 && k != 1))
    cout << "Marsel\n";
  else {
    if (n % 2 == 0)
      cout << "Marsel\n";
    else
      cout << "Timur\n";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
}
