#include <bits/stdc++.h>
using namespace std;
map<int, int> w;
int k;
int f(int x) {
  if (x <= k) {
    return 0;
  }
  if (w.find(x) != w.end()) return w[x];
  int to = (int)sqrt(x + .0) + 1, e;
  int ret = 0, cnt;
  for (int i = 1; i <= to; ++i) {
    if (x % i == 0) {
      cnt = x / i;
      if (cnt > 1 && i >= k) {
        if (!(cnt & 1))
          e = 0;
        else
          e = f(i);
        if (e == 0) {
          ret = 1;
          break;
        }
      }
      if (i > 1 && cnt >= k) {
        if (!(i & 1))
          e = 0;
        else
          e = f(cnt);
        if (e == 0) {
          ret = 1;
          break;
        }
      }
    }
  }
  w[x] = ret;
  return ret;
}
int main() {
  int n, m;
  cin >> n >> m >> k;
  int res;
  if (!(n & 1))
    res = 0;
  else
    res = f(m);
  if (!res)
    cout << "Marsel";
  else
    cout << "Timur";
  return 0;
}
