#include <bits/stdc++.h>
using namespace std;
long long dp[100000 + 10][35];
bool poww[100000 + 10][35];
long long n, m, k;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> k;
  for (long long i = 1; i <= 100000; i++) {
    long long now = 1;
    for (long long j = 1; j <= 34; j++) {
      now *= i;
      if (now >= k) poww[i][j] = true;
      if (poww[i][j - 1] == true) poww[i][j] = true;
      if (poww[i][j] == true) {
        dp[i][j] = 1;
      }
    }
  }
  if (n == 1 && poww[n + 1][m]) {
    cout << "Missing";
    return 0;
  }
  for (int i = 99999; i >= 1; i--)
    for (int j = 33; j >= 1; j--) {
      if (dp[i][j] != 0) {
      } else if (dp[i + 1][j] == 2 || dp[i][j + 1] == 2)
        dp[i][j] = 1;
      else
        dp[i][j] = 2;
    }
  if (dp[n][m] == 1)
    cout << "Masha" << endl;
  else
    cout << "Stas" << endl;
  return 0;
}
