School Team Contest #1 - E. What Has Dirichlet Got to Do with That? （DFS博弈）

E. What Has Dirichlet Got to Do with That?

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

You all know the Dirichlet principle, the point of which is that if n boxes have no less than n + 1 items, that leads to the existence of a box in which there are at least two items.

Having heard of that principle, but having not mastered the technique of logical thinking, 8 year olds Stas and Masha invented a game. There are a different boxes and b different items, and each turn a player can either add a new box or a new item. The player, after whose turn the number of ways of putting b items into a boxes becomes no less then a certain given number n, loses. All the boxes and items are considered to be different. Boxes may remain empty.

Who loses if both players play optimally and Stas's turn is first?

Input

The only input line has three integers a, b, n (1 ≤ a ≤ 10000, 1 ≤ b ≤ 30, 2 ≤ n ≤ 109) — the initial number of the boxes, the number of the items and the number which constrains the number of ways, respectively. Guaranteed that the initial number of ways is strictly less than n.

Output

Output "Stas" if Masha wins. Output "Masha" if Stas wins. In case of a draw, output "Missing".

Examples

input

Copy

2 2 10

output

Copy

Masha

input

Copy

5 5 16808

output

Copy

Masha

input

Copy

3 1 4

output

Copy

Stas

input

Copy

1 4 10

output

Copy

Missing

Note

In the second example the initial number of ways is equal to 3125. 

• If Stas increases the number of boxes, he will lose, as Masha may increase the number of boxes once more during her turn. After that any Stas's move will lead to defeat. 
• But if Stas increases the number of items, then any Masha's move will be losing. 

题意：

给你一个a^b，你可以底加1，或者幂加1，当a^b>=n使，你就输了。

POINT：

DFS搜。分情况讨论。

#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <algorithm>
using namespace std;
#define LL long long
const LL maxn = 1234 + 10;
#define INF 0x3f3f3f3f
LL cnt=0;
LL dp[50000][50];
LL sq[50000][50];
//1 first win


LL dfs(LL a,LL b,LL n)
{

	if(sq[a][b]>=n){
		return dp[a][b]=1;
	}
	if(b==1&&sq[a][2]>=n){//只能加底，那就直接判断奇偶
		return dp[a][b]=(n-a-1)%2==0?2:1;
	}
	if(a!=1&&dfs(a,b+1,n)==2)//底为1的话，就会死循环
		return dp[a][b]=1;
	if(dfs(a+1,b,n)==2||dfs(a,b+1,n)==2)//两种情况任意一种输了
		return dp[a][b]=1;//那么当前赢了
	return dp[a][b]=2;
}

LL a,b,n;
void init()
{
	for(LL i=1;i<=49000;i++){
		LL now = 1;
		LL j ;
		for(j=1;j<=40;j++){
			now=now*i;
			if(now>n+12312311233){
				break;
			}else{
				sq[i][j]=now;
			}

		}
		for(;j<=40;j++){
			sq[i][j]=n+12312311233;
		}

	}
}

int main()
{

	scanf("%lld%lld%lld",&a,&b,&n);
	init();
	if(a==1&&sq[a+1][b]>=n){
		printf("Missing\n");
	}else{
		if(dfs(a,b,n)==1){
			printf("Masha\n");
		}else{
			printf("Stas\n");
		}
	}



	return 0;
}