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]: [[-112, -17, -98, -64, -29], [-83, -82, -31, -120, -63, -175], [-82, 56, -3, -62, -42, -110, -136], [-68, 39, -48, 64]]
[A]: [-17, -31, 56, 64]


[Q]: [[10, -149, -47, 51, 72, 21, -113], [41, -39], [13, -39, -79, -154, 48, -50], [95, 30, -140, -29, -67, -37]]
[A]:
[72, 41, 48, 95]