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.

[[55, -93, -37, 78, -196, -158, 53], [-56, -98], [-196, -173, -80], [89, -61, 79, -26, -155], [-157, -161, -158, -112], [-5, -198, -158, -81, 49, -108, 33], [-93, -117, -190, -105], [-71, 91, 87, -117], [-178, -94, -127]]
[78, -56, -80, 89, -112, 49, -93, 91, -94]

[[-20, -163, -126, -26], [-7, -183], [1, 84, 39, -79, -79, -98], [13, 2, -5, 20, 98, 30, -4]]
[-20, -7, 84, 98]

[[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]

[53, 55, 93, 90, 75, 10]