#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
long long a, b, n, base[N][50];
int dp[N][50];
int dfs(long long x, long long y) {
  if (dp[x][y]) return dp[x][y];
  if (base[x][y] >= n) return dp[x][y] = 1;
  if (x * x >= n) {
    if ((n - x) % 2 == 0)
      return dp[x][y] = 1;
    else
      return dp[x][y] = 2;
  }
  if (dfs(x + 1, y) == 2 || dfs(x, y + 1) == 2) {
    return dp[x][y] = 1;
  }
  return dp[x][y] = 2;
}
int main() {
  scanf("%lld%lld%lld", &a, &b, &n);
  for (int i = 1; i < N; i++) {
    base[i][0] = 1;
    for (int j = 1; j <= 40; j++) {
      base[i][j] = base[i][j - 1] * i;
      if (base[i][j] >= n) {
        for (int k = j; k <= 40; k++) base[i][k] = n;
        break;
      }
    }
  }
  if (a == 1 && base[a + 1][b] >= n) {
    printf("Missing\n");
  } else {
    if (dfs(a, b) == 1)
      printf("Masha\n");
    else
      printf("Stas\n");
  }
  return 0;
}
