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.

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

[[-158, -76, -106, -126], [-200, -61], [-54, -41, 22, -34, -11], [-78, -53, 62]]
[-76, -61, 22, 62]

[[-32, 53, -80], [39, 28, -122], [-57, 88, -149, -25, 24], [-170, 45, 66, -137, 64, 73, -9], [25, -55, -140, -99], [-38, 35, -7], [-93, 39, -86]]

[53, 39, 88, 73, 25, 35, 39]