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: [[-29, -139], [-113, 72, 88, -95, -146, -186], [31, -151, -171, -180, -87, -12, -181]]

A: [-29, 88, 31]
****
Q: [[-150, -68, 94, -20, -105], [-115, -107, -200, -174], [43, -27, -166, -123, 34, -161, -73]]

A: [94, -107, 43]
****
Q: [[-39, -92, -157, -117, -74], [-190, -188, 46], [-132, 12], [-70, 46, -147, -65, -165, 35, -39], [11, -10, -31], [-128, 75, 79, 47, -191], [-104, 83, -116, 98], [24, 36, -131, 47, 92, -191]]

A:
[-39, 46, 12, 46, 11, 79, 98, 92]
****