A10067 | 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<=i<=n$ ), and kitten Min has $m$ pairs of non-negative integers $(c_{j},d_{j})$ ( $1<=j<=m$ ). As kitten Max makes a move, it can take any available pair $(a_{i},b_{i})$ and add $a_{i}$ to $x$ and $b_{i}$ to $y$ , and kitten Min can take any available pair $(c_{j},d_{j})$ and subtract $c_{j}$ from $x$ and $d_{j}$ from $y$ . Each kitten can use each pair multiple times during distinct moves.

Max moves first. Kitten Min is winning if at some moment both numbers $a$ , $b$ are negative simultaneously. Otherwise, the winner of the game is kitten Max. Determine which kitten wins if both of them play optimally.

The first line contains two integers, $n$ and $m$ ( $1<=n,m<=100000$ ) — the number of pairs of numbers available to Max and Min, correspondingly.

The second line contains two integers $x$ , $y$ ( $1<=x,y<=10^{9}$ ) — the initial values of numbers with which the kittens are playing.

Next $n$ lines contain the pairs of numbers $a_{i},b_{i}$ ( $1<=a_{i},b_{i}<=10^{9}$ ) — the pairs available to Max.

The last $m$ lines contain pairs of numbers $c_{j},d_{j}$ ( $1<=c_{j},d_{j}<=10^{9}$ ) — the pairs available to Min.

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