CF566G Max and Min

Two kittens, Max and Min, play with a pair of non-negative integers $ x $ and $ y $ . As you can guess from their names, kitten Max loves to maximize and kitten Min loves to minimize. As part of this game Min wants to make sure that both numbers, $ x $ and $ y $ became negative at the same time, and kitten Max tries to prevent him from doing so. Each kitten has a set of pairs of integers available to it. Kitten Max has $ n $ pairs of non-negative integers $ (a_{i},b_{i}) $ ( $ 1

The first line contains two integers, $ n $ and $ m $ ( $ 1

Print «Max» (without the quotes), if kitten Max wins, or "Min" (without the quotes), if kitten Min wins.

In the first test from the statement Min can respond to move $ (2,3) $ by move $ (3,10) $ , and to move $ (3,2) $ by move $ (10,3) $ . Thus, for each pair of Max and Min's moves the values of both numbers $ x $ and $ y $ will strictly decrease, ergo, Min will win sooner or later. In the second sample test after each pair of Max and Min's moves both numbers $ x $ and $ y $ only increase, thus none of them will become negative.