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: [[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

A: [87, 7, 73, 69, 96, -106, 48, 84]
****
Q: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]

A: [36, -23, 76, 20]
****
Q: [[-32, -62, -12, -152], [-128, -87, -100, 63], [-110, -100, -24, 93, -166]]

A:
[-12, 63, 93]
****