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.

[[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
[98, 30, 96, 87, 96, 67, 53]

[[72, -19, -46, -126], [0, 47, 52, -113, -37, -16, -81], [82, -7, 2, 84, 38], [-178, -84, 84, 14, -123]]
[72, 52, 84, 84]

[[-91, -169, -62], [-191, 1, 61, -149, -183, -140, -129], [78, 66, -147, -103, -127, 97, 99], [-9, -147], [-25, -144], [76, -102, 22, 14], [-177, 69, -114, 37]]

[-62, 61, 99, -9, -25, 76, 69]