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]: [[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]
[EX A]: [64, 19, 84, 40, 78]

[EX Q]: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]
[EX A]: [-19, -112, 30, 59, 65, -7, -16, 86, 39]

[EX Q]: [[37, -189, 60, -10], [59, -142], [26, 77, 72, -84], [-4, -157], [69, -27, -134, 0, -141], [-55, -126, 36, 3, 16, -50], [-179, 62, -75], [-72, 58, 85, -93, -5, 78, -96]]
[EX A]:
[60, 59, 77, -4, 69, 36, 62, 85]