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]: [[-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]: [[-72, 58], [-110, -110, 92, -58, -181, -159, 35], [-12, 67, -22, -15, -8, -190], [-163, -166, -128, -150, 70, 54]]
[A]: [58, 92, 67, 70]


[Q]: [[-49, -84, -99, -17], [92, -125, -75, -32, -194, -9, -21], [-66, 47, 1, -133, -33, -16], [56, 49, -94, 46, -45, 29], [-119, 96, 2, -95, 60, 38, -183], [-89, -117, -136, 11, -29], [-197, -70, -113], [-131, -73, 6, -193, 88, 41, 16]]
[A]:
[-17, 92, 47, 56, 96, 11, -70, 88]