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]: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]
[A]: [60, -32, 68, 93, 24, 26, 7, 85]


[Q]: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]
[A]: [91, 53, 82, -9]


[Q]: [[51, 33, -60], [-35, -112, -143], [-96, -149, -44, -148, 97], [7, -83]]
[A]:
[51, -35, 97, 7]