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.
[[-129, -91, -190, -138, -155], [82, -191, -76, 32], [66, -85, -66, -113, -49], [-128, -91, -46], [54, 11, -167, 74, 28, -127], [-195, -25, 74, -189, 9], [-24, -180, 92, -3, -181], [-96, -17, -144, 12, 50, -145], [16, -106, -196]]