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.
[[-128, 42, -121, -181, -134], [-192, -2, -100, -148, -181], [0, -31, -137, -162, -189, 42, -89], [-139, 77, -183, -11, -200], [71, 89, -172, -109, -125, -104, -88], [-150, 12, -47, 37], [79, 94, -135, -191], [-96, -57, -32, 30, -192, -68]]