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, -110, 46, -100, -61, -121], [-108, -24, -6, -175, 41, -41], [-184, 80, 24], [-159, -54, 91, 38, -145, 40, 98], [-92, -87, 36, 91], [-33, -199, 62]]
[A]: [53, 41, 80, 98, 91, 62]


[Q]: [[-149, -37, 36, -154, -65, 62, 57], [84, -123, 60, -42], [96, -160, -59, -77, 14]]
[A]: [62, 84, 96]


[Q]: [[-143, 16, -27, 93, -28], [92, -175, 16, 24, -67], [-126, -131], [-106, -37, -30, -200], [-161, -108, 43, 67, 27], [-39, -53, -83, -53], [59, -116], [9, -69, -28, -109], [11, -58]]
[A]:
[93, 92, -126, -30, 67, -39, 59, 9, 11]