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.

Ex Input:
[[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]

Ex Output:
[51, 49, 86, 66, 74, -151, 49, 25]


Ex Input:
[[77, -10], [-44, 22, -89], [83, -197, -135], [94, 7, -166, -111]]

Ex Output:
[77, 22, 83, 94]


Ex Input:
[[74, 75, 0], [-104, -122, 55, 84, -28], [-86, 96, -171, -9, -55, -123, 2], [-97, -137, 0, 41, -117], [18, -68]]

Ex Output:

[75, 84, 96, 41, 18]