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.

[[-163, -129, -176, 12], [-28, -195, -125, -107, 23, 69], [-128, -129, -47, -30], [-53, -56, -32, -67, -7, -81, -156]]
[12, 69, -30, -7]

[[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]
[43, 11, 11, 58, 21, 100, 25]

[[-187, -82, 76, 16], [-123, 63], [-190, -93, -190, 15, 10, -156, -90]]

[76, 63, 15]