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: [[-103, 16, -53, -29, -31, -137, -190], [-87, -195, -34, 13], [97, -68], [-67, 8, -100, -197, 19], [-76, 36, 24, -166, 20, 11], [-173, 10], [60, 8, -56]]

A: [16, 13, 97, 19, 36, 10, 60]
****
Q: [[-126, 66, -167, -175, 82, -189, -27], [-162, -53], [14, -57, 34, -143, -103], [-157, -175, -50, -40, 100, -16], [-34, 65, -158, 54], [57, 57], [-3, -47, 65], [-55, -145, -109, -124, -27, -181, 58], [-101, -147]]

A: [82, -53, 34, 100, 65, 57, 65, 58, -101]
****
Q: [[-54, 20, 41], [-14, -150, 54], [-52, 42, -76]]

A:
[41, 54, 42]
****