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: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]

A: [-17, -31, 56, 64]
****
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: [[16, 69], [-145, 15], [-144, 64, -75], [10, -151, -3], [-195, 52], [-64, -200, -17, -85, -105, 57], [-40, -188, -165, -161], [20, -117], [-83, 25, 68, -197]]

A:
[69, 15, 64, 10, 52, 57, -40, 20, 68]
****