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.

[[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[12, -10, -48, -35]

[[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]

[[-175, 26, -61, 68, -24, -154, -196], [-82, -48], [-13, -24, -70, -134, 79, -40, -62], [89, 99, -122, 8, -87], [68, -35, -175, 29, 69, 79], [52, -19, -58, 19, 43, 4], [21, -74, -98, -79, -79, -77, -172], [-168, -175, -127, -71, -129, 95]]

[68, -48, 79, 99, 79, 52, 21, 95]