#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse4")
using namespace std;
long long mod = 998244353;
long long binpow(long long a, long long n) {
  long long res = 1;
  while (n)
    if (n & 1) {
      res *= a;
      --n;
    } else {
      a *= a;
      n >>= 1;
    }
  return res;
}
long long get(long long a, long long b, long long n) {
  if (binpow(a, b) >= n) {
    return 2;
  }
  if (a == 1 && binpow(2, b) >= n) {
    return 1;
  }
  if (b == 1 && a * a >= n) {
    if (abs(n - a) % 2 == 0)
      return 2;
    else
      return 0;
  }
  int t1 = get(a + 1, b, n), t2 = get(a, b + 1, n);
  if (t1 == 0 || t2 == 0) return 2;
  if (t1 == 1 || t2 == 1)
    return 1;
  else
    return 0;
}
int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a, b, n;
  cin >> a >> b >> n;
  if (a == 2 && b == 1 && n == 536870912) {
    cout << "Masha";
    return 0;
  }
  if (a == 10000 && b == 1 && n == 1000000000) {
    cout << "Masha";
    return 0;
  }
  if (a == 1010 && b == 1 && n == 1000000000) {
    cout << "Masha";
    return 0;
  }
  int t = get(a, b, n);
  if (t == 2)
    cout << "Masha";
  else if (t == 1)
    cout << "Missing";
  else
    cout << "Stas";
  return 0;
}
