#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using i3 = pair<int, ii>;
using li = pair<ll, int>;
using lii = pair<ll, ii>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<ii>;
using vli = vector<li>;
using vpll = vector<pll>;
using vi3 = vector<i3>;
using vlii = vector<lii>;
const int N = 2e5 + 5;
const ll INF = 1e17 + 7;
const double eps = 1e-9, PI = acos(-1);
int n, m, k;
void solve(int testCase) {
  scanf("%d %d %d", &n, &m, &k);
  bool can = false;
  for (int i = 1; i * i <= m; i++) {
    can |=
        ((m % i == 0) && (((m != i) && (i >= k)) || ((i > 1) && (m / i >= k))));
  }
  printf("%s\n", (can && (n & 1)) ? "Timur" : "Marsel");
}
int main() {
  int t = 1;
  for (int testCase = 1; testCase <= t; testCase++) {
    solve(testCase);
  }
  return 0;
}
