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

2 2 10


Output

Masha


Input

5 5 16808


Output

Masha


Input

3 1 4


Output

Stas


Input

1 4 10


Output

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.

Source: codeforces | Difficulty: HARD
Tags: Dynamic programming

Game theory


Solutions:
(a, b, L) = list(map(int, input().split()))
memo = {}
memo[31701, 1] = (L - 31701 + 1) % 2
memo[1, 30] = -1
for i in range(31700, a - 1, -1):
	for j in range(29, b - 1, -1):
		if i ** j >= L:
			continue
		s = set()
		if (i + 1) ** j < L:
			s.add(memo[i + 1, j])
		if i ** (j + 1) < L:
			s.add(memo[i, j + 1])
		if 0 not in s and -1 in s:
			memo[i, j] = -1
		else:
			mex = 0
			while mex in s:
				mex += 1
			memo[i, j] = mex
if memo[a, b] > 0:
	print('Masha')
elif memo[a, b] == -1:
	print('Missing')
else:
	print('Stas')


(a, b, L) = list(map(int, input().split()))
import sys
import math
if a == 1 and 2 ** b >= L:
	print('Missing')
	sys.exit()
memo = {}
memo[32001, 1] = 0
memo[1, 30] = 0
for i in range(min(int(L ** (1 / b)) + 1, 32000), a - 1, -1):
	for j in range(29, b - 1, -1):
		if i ** j >= L:
			continue
		s = set()
		if (i + 1) ** j < L:
			s.add(memo[i + 1, j])
		if i ** (j + 1) < L:
			s.add(memo[i, j + 1])
		mex = 0
		while mex in s:
			mex += 1
		memo[i, j] = mex
if memo[a, b] > 0:
	print('Masha')
else:
	print('Stas')