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.

[[-134, -48, 4, 24, 71, -187, -166], [44, 10, 44, -55], [-63, -29, 15, -89, 78, 63, -106], [-112, -11, -134, 87, -46], [-128, -93, 68, -87], [-147, -63, 91]]
[71, 44, 78, 87, 68, 91]

[[-7, 38, 91, -146, -16, -169], [48, -155, 86, -44, 100, -92, 31], [-114, -7, -28, 51, 86, -4, 76], [84, 82, 71], [13, 2], [22, 53, -152], [-32, -137, -157], [-55, 14, -129, -58, 54, -10]]
[91, 100, 86, 84, 13, 53, -32, 54]

[[-74, 17, -79], [-89, -69, 43, -153, -25], [-196, -65], [-112, 12], [-84, 85, -116, -1, -175], [-107, 13, -78, -21, 21, -83]]

[17, 43, -65, 12, 85, 21]