#include <bits/stdc++.h>
using namespace std;
int f[50000][35];
int c;
long long pow(int a, int b) {
  if (!b) return 1;
  long long tmp = pow(a, b >> 1);
  tmp *= tmp;
  if (b & 1) return tmp * a;
  return tmp;
}
int work(int n, int m) {
  if (pow(n, m) >= c) return 2;
  if (n == 1 && (1ll << m) >= c) return 1;
  if (m == 1 && (long long)n * n >= c) return (~(c - n) & 1) << 1;
  if (~f[n][m]) return f[n][m];
  return f[n][m] = 2 - min(work(n + 1, m), work(n, m + 1));
}
int main() {
  int n, m;
  cin >> n >> m >> c;
  memset(f, -1, sizeof(f));
  switch (work(n, m)) {
    case 0:
      cout << "Stas" << endl;
      break;
    case 1:
      cout << "Missing" << endl;
      break;
    case 2:
      cout << "Masha" << endl;
      break;
  }
  return 0;
}
