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, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]
[52, -25, 74, 91, 52, 98, -13, 95]

[[51, -183, -71, 96, -4, -35], [-117, -140, -14, 94, 71]]
[96, 94]

[[-184, -39, -143], [99, -37, -17, -11, 82, -143, -170], [45, -169, -120, -196, 72, 54], [-192, -87, -117, -151], [-198, -27, -160, 5]]

[-39, 99, 72, -87, 5]