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: [[53, -34, -71, -43, -141, -174, -73], [5, -80, -181, -140, -63, -86, 34], [-86, -1, 91, 15, -191], [-171, 1, -62, 9, -161, 40, 35]]

A: [53, 34, 91, 40]
****
Q: [[-111, -54, -11, -97, -137, 82], [63, -197, 31]]

A: [82, 63]
****
Q: [[32, 4, -29, -31, -60, -75, 93], [-160, -55, -47, -104, 64, -140, -113], [17, -112, -65, 16, -64], [99, 38, 4, -122, 41, -174], [-174, -168, -34, 48, -18], [-92, -177], [-129, -6], [8, -187, -141, 37, 92], [-163, -12, -186, -198, -159, -12]]

A:
[93, 64, 17, 99, 48, -92, -6, 92, -12]
****