In the theory of games and economic behavior, founded by John von Neumann, certain two-person games can be represented by a single two-dimensional array, called the payoff matrix. Players can obtain optimal strategies when the payoff matrix has a saddle point. A saddle point is an entry in the matrix that is both the minimax and the maximin. The minimax of a matrix is the minimum of the column maxima, and the maximin is the maximum of the row minima. The optimal strategies are possible when these two values are equal. Write a program that prints the minimax and the maximin of a given matrix.