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.

[[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]
[45, 33, 26, 69, 89, 95, 57, -4]

[[-15, 93, -70, -39], [-157, -29, 74, -14, -155], [74, -176, -85, -143, 4, 0, -25]]
[93, 74, 74]

[[-59, 51, -3, -131, 99, -174, 19], [-199, 5, -10], [55, -64, 36, -1], [37, -162, -110], [-195, -85], [-20, -101, 11, -79, 42, -19]]

[99, 5, 55, 37, -85, 42]