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.

[[-88, 24], [-125, -39], [95, -76, -84, -69, -190, -148], [-196, 71, -2, -91, -112]]
[24, -39, 95, 71]

[[-123, -64, -37, -55], [-170, -193, 73, 94], [-21, -159, -100], [-59, -193, -156, 76], [21, -147, -140, -165, 85, -14], [-51, 57, 85, 1, -69, 93], [-156, -17, 72], [-48, -165, -96, -148, 5, -147], [-81, -55, 87, -12, -9]]
[-37, 94, -21, 76, 85, 93, 72, 5, 87]

[[-119, -180, -68, -163], [-175, 15, 52], [78, 50, 57, 39, -71, -124, -108], [19, -98, -146, -89], [81, -152], [-144, 8, -140]]

[-68, 52, 78, 19, 81, 8]