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.

[[-153, -153, -77, 39], [6, -153, -68, -193, -39], [91, -51, -48], [-140, -7], [-165, 52], [-92, 91, 70, 99, -128, -191]]
[39, 6, 91, -7, 52, 99]

[[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]
[65, 75, 21, 82, 4, -3, 21]

[[-188, -200, 14, 99, -188, -86], [-45, -10, -163, -29], [-138, -34, -182], [-155, -160, 94, -173, 91, -173, 94]]

[99, -10, -34, 94]