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]: [[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]
[A]: [59, -12, -25]


[Q]: [[54, 83, -51, -150, -2, -16, -46], [-55, 91, -47, -111], [-31, 46, -124, -178, 21, -17, -72], [53, -71], [-122, -122, -119, -33, 6, 29], [-42, 77, 27, -38, -20], [22, -22, -81, -136, 52, -50, -125], [-119, -115, -194, -102, -200, -68, -186], [-33, -105, -155]]
[A]: [83, 91, 46, 53, 29, 77, 52, -68, -33]


[Q]: [[45, 84, -179, 69, 24, 41, -48], [-82, -12, -49, 64, 81, -68], [-81, -10, -172], [-127, -69, -49, -11, -5, -191, 90], [-135, -120]]
[A]:
[84, 81, -10, 90, -120]