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: [[-164, 47, -194, 68, -157, -197], [-104, -30, 57, -31], [-125, 94, -188], [3, -100, -5, -114], [88, -193, 36], [34, -122]]

A: [68, 57, 94, 3, 88, 34]
****
Q: [[-187, -137, -154], [-36, -31, -1, -81, 8], [71, -85, -87], [16, -91, 30], [-176, -77, 12, -100, -135]]

A: [-137, 8, 71, 30, 12]
****
Q: [[-46, 30, -30, 34, -19], [-89, 0, 81], [97, -51], [-6, -110, -160, 9, -141], [-132, 92, 3, -193, -21, -142, 20], [55, -180], [86, -1, 60, 53], [-31, 31, -70, -65]]

A:
[34, 81, 97, 9, 92, 55, 86, 31]
****