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]: [[-195, 0], [42, 19, -7], [-155, -76, -83], [-144, 19, 88], [-139, -174, -137, 59]]
[A]: [0, 42, -76, 88, 59]


[Q]: [[-113, 36, -122, -72, -47], [-168, -23], [76, 65, -142], [-181, 20]]
[A]: [36, -23, 76, 20]


[Q]: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[A]:
[95, 47, 66, 75, 33, 72, 9]