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]: [[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]
[EX A]: [54, 30, 52, -59, 74, 43, -151, 64]

[EX Q]: [[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]
[EX A]: [-121, 80, 98, 56, -17, 10, 55]

[EX Q]: [[-163, 20, -81, -51], [-45, -97], [-123, 41, -83, -104, -161, -74], [-169, -111, -114, 75, -199, -103, 82], [-89, -109, -121], [-118, 39, 96, 96, -194, -172], [96, -163, -103, -11, -186, -76, -56]]
[EX A]:
[20, -45, 41, 82, -89, 96, 96]