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.

[[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]
[93, 68, 96, 94, 81, 71]

[[-29, 35, -38, -160, -138], [-179, -69], [-171, -170, -136, -81], [78, -45, 92], [-6, 91, -167, -63, -193, 69], [58, 42], [-152, -58, -89, -148, 48], [-81, -41, -193, -127]]
[35, -69, -81, 92, 91, 58, 48, -41]

[[32, 83, -139, 60, -46], [-177, -140], [12, 2, 95, -51, -21, -113], [-25, -68], [-86, -161, 13, 70, -65, 77, 74], [1, -194, -200, -144, -163, 15]]

[83, -140, 95, -25, 77, 15]