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]: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
[A]: [76, -40, 87, 30, 27, 27, 51]


[Q]: [[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]
[A]: [25, 32, 86, 96, -33, 84, 93]


[Q]: [[84, -15, -28, -191], [40, -154, -148, -18, -68, -150, -19], [-100, 56], [3, 56, -120], [13, 68, -139, -196], [-40, -34, -148, -164, -130, -9, 57]]
[A]:
[84, 40, 56, 56, 68, 57]