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.

[[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
[25, 32, 86, 96, -33, 84, 93]

[[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]
[91, 100, 86, 84, 13, 53, -32, 54]

[[-98, -87, -153, -133, -75, 73], [-78, 43, -126, -125, 15], [37, -182, -154, -4, 92, 59], [73, 65, -132]]

[73, 43, 92, 73]