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: [[-81, 65, -143, -49, -125, 36, -53], [-37, -168, 75], [-192, 56, 4, 48, 69, -141, -79], [-75, -151, -50, 0, -158, -195, 44], [-159, -180, -122, -57, 52, 18, -94], [-32, 2, -54, -25, 16, -52]]

A: [65, 75, 69, 44, 52, 16]
****
Q: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]

A: [25, 32, 86, 96, -33, 84, 93]
****
Q: [[90, -46, -137, -47, -26], [-35, -72, -28, -32, 3], [-29, -120], [-10, -93, -190, -44, 85, 26, -99], [-28, 40, 4], [10, 95], [-89, -191, 42, -137, -167, -32, -55]]

A:
[90, 3, -29, 85, 40, 95, 42]
****