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]

[[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]
[79, 83, 25, 75, 98, 92, 84, 92, 28]

[[-105, 60, -65, -97, -76, 48, -51], [-92, -158, -180, 81, -91, 94], [24, -41, -94, -179], [45, 77], [-87, 79], [60, 21], [-4, -34, 77, -185, -87], [47, 61, -45, 34, -104]]

[60, 94, 24, 77, 79, 60, 77, 61]