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.

[[-112, -32, 5, -133], [-57, -42, -9, 22, 64]]
[5, 64]

[[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]
[-137, 8, 71, 30, 12]

[[-72, 73, 43, -145, -155, 67], [-38, -186, 37, -182, -141, -92, -176], [-174, -125, -125], [37, 67, -196, -55], [13, -65, 68, 83, -161, -111, 75], [-152, 20, 32, 36, -66, -194, -154]]

[73, 37, -125, 67, 83, 36]