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: [[10, -182, -172, -154, 42, -42, -159], [10, -7, 32, -26], [-79, -77, -179], [57, 21, -139, -114, 23, -177, 24], [-122, 57, -110, 84], [42, -107, -190, -73, -184, -186]]

A: [42, 32, -77, 57, 84, 42]
****
Q: [[72, -172, -132, 93], [-200, -74, -56, -40, -68, -163, -58], [-72, -164], [-166, -70, -127, -16, -41, -121, 13], [-56, 91], [-181, 35, -12, -99, -122], [-66, 33], [18, -141, -40, 28, -175, -102, -63]]

A: [93, -40, -72, 13, 91, 35, 33, 28]
****
Q: [[-54, -82, -21], [89, -10, -98, -44], [97, -46, -61, -132, -146]]

A:
[-21, 89, 97]
****