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.

[[10, -182, -172, -154, 42, -42, -159], [10, -7, 32, -26], [-79, -77, -179], [57, 21, -139, -114, 23, -177, 24], [-122, 57, -110, 84], [42, -107, -190, -73, -184, -186]]
[42, 32, -77, 57, 84, 42]

[[47, -65, -11, 25, -17], [-93, -195, -89, 27, -81, -190], [-59, -20, -10, 93, -93], [-130, -31, 67, -36, -18, -125], [54, 100, -27, -38, -154, -96], [-148, 23, 70, -162, -145], [-83, -95, -44, 11, -155], [-43, -195, -94, -5], [-17, -99, -23, -176]]
[47, 27, 93, 67, 100, 70, 11, -5, -17]

[[-53, 45, -28, -159], [-174, -161, -104, -146, -48, -3], [56, -174, -196, -19, -185, -60], [-96, 38, 38, 16], [-121, -149]]

[45, -3, 56, 38, -121]