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.

[[38, 7, -17, -108, -56, 8], [-165, 25, -30, -191, -19, -95], [-7, -124, -23, -13], [-83, -144, -95, -92, -2, 1, -73], [5, -111, 30, -128, 40, 2, 5], [59, -103, -28, 92, -106], [-180, 68, -149, 87, -159, -12], [-14, 76], [-95, -128]]
[38, 25, -7, 1, 40, 92, 87, 76, -95]

[[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]
[97, -35, 7]

[[-90, -1, 59, -61, -173, -57], [-103, -14, -112, -156], [-13, 31], [-179, -62, -55, -137], [-12, -83, -87, 44, -18, -171, -107], [-34, -175, -27, 10, -199, -124], [86, 75]]

[59, -14, 31, -55, 44, 10, 86]