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: [[57, 1, -116, -74, 72, -86], [-19, -44, -181, 89, -174, 39, 96], [-170, -82, -59, 83]]

A: [72, 96, 83]
****
Q: [[-94, -23, -131, -75], [94, 72, -29, -30, -63, 86], [42, -62, -33], [34, -167], [-197, 7, -89, -184, 96], [-75, -131, 2, -6, -111, 77, -36], [48, -32, -41, 73], [-178, 60, -5, 39, 40, -27], [-47, -192, -25, -122, -38, -100]]

A: [-23, 94, 42, 34, 96, 77, 73, 60, -25]
****
Q: [[37, -92, -86], [-172, 29, -11, 61, -136, 66, -115], [-6, -4, -114, -105, -156, 37, 40], [33, -137, 69, -172, -122], [-164, 59, 67, 58, 36]]

A:
[37, 66, 40, 69, 67]
****