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.

[[30, -72, 78, 12, -87, -118, 40], [-139, 17, 10, -139, -120, 53, -127], [-122, 28, -161, 93, 9, -171], [-195, 86, -34, 15, 73], [-71, -31, -147, -106]]
[78, 53, 93, 86, -31]

[[-124, -72, 94], [40, -5, -15, -98, 79, -94, -45], [53, -40, -73, -117, -195, -50], [20, 51, -140], [-30, -112, 25, 35, 84], [-40, -135, -184, -159, -33, -59]]
[94, 79, 53, 51, 84, -33]

[[-50, -16, -144, 95, -18, 76, -71], [-11, 72, -174, -102, -24, -31], [-81, 45, -105], [-154, -72, -98, -126, -95, -29, 99], [-2, -57, 22, -36, 43], [-57, -197, -76, -55, -36, 9], [-154, -44, -106, 13, 86], [-199, 61]]

[95, 72, 45, 99, 43, 9, 86, 61]