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: [[-101, -84, 47, -147], [-117, -82, -152, -159, 40]]

A: [47, 40]
****
Q: [[83, -105, -170, -58, -169, -177], [79, -174, 31], [34, 33, -127], [-141, 49, -55], [-48, 11, -2, -9, -21], [-75, -46, -144, -106, -46, -35, 75], [-6, -177, -101], [67, 44, -184, -93, -106, 41], [-135, -96]]

A: [83, 79, 34, 49, 11, 75, -6, 67, -96]
****
Q: [[-13, -52, -15], [1, 77], [-52, 36, -175, -7], [-198, -129, -162, -64, 74], [-172, 10, -93, 61], [-52, -53, 0, -19]]

A:
[-13, 77, 36, 74, 61, 0]
****