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.

[[-28, -118, -156, -57, -161], [-29, -157, -63, 77]]
[-28, 77]

[[-71, 79, -195, -49], [-104, 58, 65], [-160, -87, -144, -169, -98], [-82, 89, -192, -144, 62, 18], [-169, -22, -174, -2, -151, -122], [-95, -162, -13], [-32, -166, -37, -69, 20], [-184, -195]]
[79, 65, -87, 89, -2, -13, 20, -184]

[[-183, -4, -104, -79, -26, -200], [-80, 13, -131, 15, -122, -181, -132], [-40, -102, -178, -86, -172], [98, -135, -71, -3], [-96, -32, -20, -151, -96, 7], [-9, -194], [-121, -168, 72, 14, -88, 98], [-135, -173, -110]]

[-4, 15, -40, 98, 7, -9, 98, -110]