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]: [[-50, 43, 3], [53, -199, 72, -60], [-135, 10, -186, -112], [92, -118, 88, -13, -183, -152, -20], [-173, -114, 85, -130, -153], [-186, -104], [-153, -52, -33, 41, -117, 16, -188], [-77, -47, -26, 19, -93]]
[EX A]: [43, 72, 10, 92, 85, -104, 41, 19]

[EX Q]: [[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]
[EX A]: [51, 49, 86, 66, 74, -151, 49, 25]

[EX Q]: [[-9, -117, -15, 36, -62, 49, -87], [-169, 79, 48, 59, -122, -181, 2], [-162, 4, 8], [-86, 70, -185, -115, -70]]
[EX A]:
[49, 79, 8, 70]