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.

[[-86, -87, 49, -98, -10, -60, -42], [-88, -27, -163], [-174, -132, -148], [-103, 1, -198, 6, 98], [-172, -152, 63, 9, -166, -70, 73], [-91, 30, 74]]
[49, -27, -132, 98, 73, 74]

[[-70, -183, -171, 49, -87], [-53, -85, -127, -81], [-62, -55, -77, -17, -96, -186]]
[49, -53, -17]

[[-63, -83, -24, 81, -183], [-51, -66, -110, -152, -143], [-87, 19, 53], [-17, -187, -163, 57, -174], [-102, 5, 61], [-81, -11, 24, -166, -38, -130, -108], [-189, 64]]

[81, -51, 53, 57, 61, 24, 64]