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: [[21, 93], [-100, -173], [-188, 27, -86, 50], [-33, 18, -47, -166, 56, -97], [23, -41, 20, -39, -99, 90], [-87, -177, -106], [45, 74, 10, -13, -153], [77, -85, -15, 25, 82], [48, -39, -19, 49, 19, -79]]

A: [93, -100, 50, 56, 90, -87, 74, 82, 49]
****
Q: [[40, 96, -10, -167, 17, -74], [62, -52, -157, -16, -41, 37, 0], [75, -62, 19, -95, 99], [74, -2, -8, -119, 78], [-164, -33, -50, 10, 49], [36, 3, -29, -32, -89], [-80, -58, -62], [20, -148, 20, 97, 60, -142, -71], [57, -103, -133]]

A:
[96, 62, 99, 78, 49, 36, -58, 97, 57]
****