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.

[[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]
[25, 54, -45, 79, 96]

[[18, 65, 44, -95, -55], [-117, 45], [-29, -66, -85, -25, -53, 9]]
[65, 45, 9]

[[-193, -73, 73, -84, 7, -19], [-111, 26, 56, 1, 1, 87, 37], [76, -35, -84, -177, -88], [-38, 25, -56, -45, -50, -94], [65, 62, -175, -174, 28, -22], [82, -179, -149], [81, -44, -132, -13], [-178, -131, -101, -9, -182, -49]]

[73, 87, 76, 25, 65, 82, 81, -9]