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]: [[98, -52, -91, -43, -31], [-140, 30, -153, -111, 2, -127], [-45, 96, 67, 56, 72, 10], [87, -89], [-95, -164, -61, 63, 96, -105], [-75, -179, 22, 67, -98], [-121, -25, 53, -174]]
[EX A]: [98, 30, 96, 87, 96, 67, 53]

[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]: [[54, -59, 51, -152], [-68, 49, -78, 8, -42, -73], [11, 65, -27, -138, 34], [57, 74, -16, -59, -30, 47], [-152, -112, -43, 53], [-19, 20, -57, -87, -163, -24], [57, -16, -198, -89, -63, 42], [-101, -79, 88]]
[EX A]:
[54, 49, 65, 74, 53, 20, 57, 88]