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]: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]
[A]: [53, 64, -34, 92, 22, 82, 85, 81, 43]


[Q]: [[-162, -197, 57, -149], [71, -127, 21, -120, 56, -18, 82], [-18, 1, -152, -113, 5, -53], [-138, 28], [70, -65]]
[A]: [57, 82, 5, 28, 70]


[Q]: [[51, -76, 58], [-20, -38], [-174, -126], [-140, 5, -46, 8, 84, -129, -3], [-104, -54, -169, -77, -14, -21], [-27, -170, 61, -123, -35, 18]]
[A]:
[58, -20, -126, 84, -14, 61]