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.

[[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]
[-55, 98, -27]

[[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]
[83, 79, 34, 49, 11, 75, -6, 67, -96]

[[65, -3, -153, -12, -120, -30, -66], [95, -192, 0, -151, -162, 54, 84], [-154, -180, -134, -67, -22, 74], [-18, 27], [-69, 24], [-4, -175, -112], [43, -160], [-3, -82, 86, 9, 96, -100, -111], [-14, -8, 58, -7, -104, 2, -113]]

[65, 95, 74, 27, 24, -4, 43, 96, 58]