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.

Q: [[53, -158, -69, 79, -98, -187, 65], [0, -152], [-171, -149, -71, -181, -72, -155], [32, 31, -153], [78, 34, -148, -1, 98, -69], [-157, 26, -9, -200], [-147, 20], [-85, 70, 35, -84, 25, -58]]

A: [79, 0, -71, 32, 98, 26, 20, 70]
****
Q: [[58, -59, 67, 49, -141, -53], [90, -175, -119, -145, -172, 72, -40]]

A: [67, 90]
****
Q: [[77, -46, 68], [-103, -183, -47, -182, -87, -188], [-171, 67, 100, 47], [-172, -99], [66, 12], [-191, -169, -71, -104, 93, 58], [-140, -130, -122, -200, -109, -33, -97], [95, -36, -26]]

A:
[77, -47, 100, -99, 66, 93, -33, 95]
****