Write a program implementing Young Tableau operations.

An m times n Young tableau is an m times n matrix such that the entries of each row are in sorted order from left to right and the entries of each column are in sorted order from top to bottom. Some of the entries of a Young tableau may be infinity, which we treat as nonexistent elements. Thus, a Young tableau can be used to hold r lessthanorequalto mn finite numbers