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]: [[60, -29, -4, -29, 18, -10], [-36, -96], [67, -88, 94, -86, 8, -72], [68, -27, -83, -29, -109, 20], [19, 36], [-121, -64], [-165, 30, 41, -119, -11, 38]]
[EX A]: [60, -36, 94, 68, 36, -64, 41]

[EX Q]: [[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]
[EX A]: [52, 80, 98, 38, 69, 81, 8, 64]

[EX Q]: [[-47, -179, 56, -116, -181, -64], [-97, -167, -94, 19, -167, 16, 29]]
[EX A]:
[56, 29]