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]: [[-61, 31, -135, 15, -167, 30], [-1, -18], [65, 41, -43, -165, -28, -135], [-15, -117], [-38, -151], [12, 59, -5, -79, -104, -109, -93], [-66, -61, -171, -23]]
[EX A]: [31, -1, 65, -15, -38, 59, -23]

[EX Q]: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]
[EX A]: [53, 55, 93, 90, 75, 10]

[EX Q]: [[-48, 14], [-179, 92, 20, 69, -121, -124, 53], [-50, -50, -178, 24, -151, -123], [-164, 59, 43, 54, 93], [-127, -137, 64, -136, 69], [-146, 42, -170]]
[EX A]:
[14, 92, 24, 93, 69, 42]