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]: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]
[EX A]: [53, 64, -34, 92, 22, 82, 85, 81, 43]

[EX Q]: [[-45, -161, -135], [-58, 5], [-182, -22], [-182, 68, -47], [18, -169, 34, -140, -127], [-61, -22, -127, 57], [-100, -75, 20, -103, -115], [-24, 41, -119, -42, -3, -47, -170], [-158, -29]]
[EX A]:
[-45, 5, -22, 68, 34, 57, 20, 41, -29]