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.

[[-24, 92, -135, -45, -58, 69], [-171, -28], [-40, -44, 82, 82, 98], [-153, -155, -64, 72, -59, -39, -25], [-167, -30, -48, 23, 4, -6]]
[92, -28, 98, 72, 23]

[[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]
[22, 9, -80, 65]

[[57, -113, -161, 71], [-197, 17], [-181, -191, -177, -116, -71], [-150, -166, 51, -178, -49], [74, 74, -104], [-168, -74, -71, -195, 33, -160], [99, 96, 76, -74, -116]]

[71, 17, -71, 51, 74, 33, 99]