In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

[[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]
[93, -40, -72, 13, 91, 35, 33, 28]

[[20, 71, -57, -136, 45], [-3, -147, -182], [48, -161, 35, -16, -193], [7, 90, -78, -102], [-108, 92, 30, -147, -86, -132]]
[71, -3, 48, 90, 92]

[[-159, -131, -194], [-127, 53, -157, 50, -105, -14], [54, -52, -184, 46, -28, -182], [-121, -155, -181]]

[-131, 53, 54, -121]