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.

[EX Q]: [[-99, -20, 1, -195], [47, -92, -16, 34, -113, 62, 3], [-200, -20, -92, 100], [-27, -94, 26, -53, -67], [-73, -16, -70, 12, 85, -173, -193], [-183, -64, -9, 56, -73, -21, -76], [-69, -9, -193, -108, -97]]
[EX A]: [1, 62, 100, 26, 85, 56, -9]

[EX Q]: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]
[EX A]: [-137, 8, 71, 30, 12]

[EX Q]: [[-182, -10, -20, -66], [65, 20, 51, 28, -134, 50, -1]]
[EX A]:
[-10, 65]