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]: [[4, 27, 7, 92, -49], [-198, 59, -131, -73], [-130, -48, -135, 58], [57, -189, -99, 66, 51, 1], [90, 55, -174, -161, -148, -181]]
[A]: [92, 59, 58, 66, 90]


[Q]: [[-153, 77, 64, -116, -130], [-176, -137, -198], [22, -14, -129, 76, -76], [-15, -37, 92, -141, -51], [13, 89, -191, -24, -197], [-11, 30, -51, 61, 26, 7, -105], [-126, -126], [-178, -132, 98, -22, 77], [7, -190, 60, -51, 62]]
[A]: [77, -137, 76, 92, 89, 61, -126, 98, 62]


[Q]: [[-20, -71, 6, -138, -187, -81, -191], [-157, -134, -87, -121, -73, 46, -152], [-96, -45], [-63, -12, 26, -139, -8, -198], [-135, -30, -142, -10], [-101, 16, -196, -162, -58], [93, -36, -155], [-41, 21, 38, -57, -173, -104], [-16, 53, -160]]
[A]:
[6, 46, -45, 26, -10, 16, 93, 38, 53]