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.

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

[EX Q]: [[-105, 91, -50, 93, -119, -108], [-190, -161, -97, -149, -13, 57], [-138, -124, -182, 20, -75, 98, -127], [-200, -188, -102, -171, -179, 60, 29], [-69, -87, 15, -52], [-177, -147, -64], [-147, -198, -141, -67, -9, -135, -106]]
[EX A]: [93, 57, 98, 60, 15, -64, -9]

[EX Q]: [[-88, -78, -21], [-154, -184, -116, -32, -111, -121], [-14, -137, -43, -117], [-75, 38, -76, -138, -108, -102, 42], [12, -66, -91, 100, -55, 2]]
[EX A]:
[-21, -32, -14, 42, 100]