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: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]

A: [34, 39, 62, 66, 38, -85, -2, -53]
****
Q: [[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]

A: [75, 57, 75, 20, -95, 20]
****
Q: [[81, 4, -36, -49], [-65, 96, 96, -72, 29, 6, -194]]

A:
[81, 96]
****