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.

[[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]
[-110, 37, 0, 24]

[[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]
[89, 85, 85, 1]

[[-27, 63, -61, 14, -115], [-150, -131, -100, -77], [7, -127, -30, -30], [68, -190, -155, -173, -172, 6, -110], [-96, 70, 85], [-25, -126, -182, -72], [-7, -141, -129, 78, -10, -175], [-82, -139, 39, -186]]

[63, -77, 7, 68, 85, -25, 78, 39]