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: [[-29, -11, 24], [48, -176], [-159, -49, -55, -186, 2, -143, -199], [-91, -164, -58, 1, -28], [-28, -18, -53, -63, -145, 18, -19]]

A: [24, 48, 2, 1, 18]
****
Q: [[-154, -106, -158, 36, 91, -3, -98], [-49, -85, 23, 14, -170, -169, -170], [-177, -51, -192, -57, 64, 83, -173]]

A: [91, 23, 83]
****
Q: [[10, -106, -199, -115, 81], [-6, -12, 81, 11, 22, -154], [-49, -129, -72, -128, -149], [-186, 66, -198, 23, -162, -96, -109]]

A:
[81, 81, -49, 66]
****