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.

[[-57, -10, -27, -160], [-80, -130, -16, 25], [-65, -106, 30, -104, -20, 77], [-192, -87, -49, 64, 43, 94, 82], [-81, -10, 20, -28, 79, 73, -1], [-191, -83, -113, 40, 6]]
[-10, 25, 77, 94, 79, 40]

[[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]
[-23, 94, 42, 34, 96, 77, 73, 60, -25]

[[-88, -149, 82, -26, 54, 72, 52], [-181, -123, -136, 56], [-46, -157, -100, -74, -92, -55, 96], [63, -65, 50, -117, -165, -52, 71], [94, 13, -130, 93, -98, 64], [74, 91, 11], [-192, -168, 66, -55, -75]]

[82, 56, 96, 71, 94, 91, 66]