func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( -O2 )   using namespace std;   void err(istream_iterator<string> it) {}   template <typename T, typename... Args>   void err(istream_iterator<string> it, T a, Args... args) {     cerr << *it <<   =   << a << endl;     err(++it, args...);   }   const int LIM = 1e5 + 5, MOD = 1e9 + 7;   int t, n, m, k, x, y;   map<int, int> M;   int solve(int m) {     if (m < k) return 0;     if (M.find(m) != M.end()) return M[m];     vector<int> a(3000, 0);     for (int i = 1; i < (int)1e5; i++) {       if (i * i > m) break;       if (m % i == 0) {         if (i > 1 && i & 1 && m / i >= k)           a[solve(m / i)] |= 1;         else if (m / i >= k && i > 1)           a[0] |= 1;         if (m / i > 1 && (m / i) & 1 && i >= k)           a[solve(i)] |= 1;         else if (i >= k && m / i > 1)           a[0] |= 1;       }     }     int ans = 0;     while (a[ans]) ans++;     return M[m] = ans;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     cin >> n >> m >> k;     if (n & 1) {       int ans = solve(m);       if (ans)         cout <<  Timur n ;       else         cout <<  Marsel n ;     } else       cout <<  Marsel n ;     return 0;   }   