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.

[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]
[96, 48, 65, 19, -26, 95, -11]

[[51, 10, -181, -96], [-40, 69, 46, -116, 53], [-135, 92], [-151, 35, -65, 52], [23, -125, 82, 57, -57], [-185, -94, -73, -131, -191, 70, -154], [9, 65, 41]]
[51, 69, 92, 52, 82, 70, 65]

[[-98, -96, -85, -168], [53, 39, -36, 66, 51], [-102, 4, -88, -179, -89], [99, -147, -159], [-164, -15, -78], [41, 44, -146, -154], [-75, -180]]

[-85, 66, 4, 99, -15, 44, -75]