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]: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[A]: [10, 83, 86, 22]


[Q]: [[-181, -180, 67, -144, 81], [-111, -185, -90, -148], [-57, 8, -160, -124, -144], [-127, 69, -3, -93, -101], [57, -173, 91, -38], [-75, -50, 8, 83]]
[A]: [81, -90, 8, 69, 91, 83]


[Q]: [[-40, -188, -186], [-45, -169, -8], [-93, -149, -170, 60], [-40, -80, -137, -105, 65, -30, -197], [-83, -38, -148, -54, -96], [12, -43], [7, -156, -103], [19, -141, -189, 84, -26]]
[A]:
[-40, -8, 60, 65, -38, 12, 7, 84]