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]: [[-138, -72], [-151, 92, -186, 54], [-169, -71, 6, -69, 0, 15]]
[EX A]: [-72, 92, 15]

[EX Q]: [[-1, -18, -21, -99, 21, -199, 63], [56, -92, -99, -67, -19]]
[EX A]:
[63, 56]