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]: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]
[A]: [37, 75]


[Q]: [[78, 11, 69, -139, 60, -155, -126], [-8, 1, -98, 2, -45, -50, -53], [43, 18], [-144, -9, 74, 33, -83], [40, -125, 67, 6, 51, -145, 24], [31, 26, -4, -124, -87], [-58, -79, 40, -146], [91, -168]]
[A]: [78, 2, 43, 74, 67, 31, 40, 91]


[Q]: [[-145, 98, -181, -84, -3], [-136, -131, 82, -69, 66, -154], [-72, 96, -103, 66, -130, -146], [58, 48, 55], [36, -48, 25, -112, 92, -79, -107], [-104, -178, -103], [-101, -189, -5, -194]]
[A]:
[98, 82, 96, 58, 92, -103, -5]