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]: [[-12, 54, 78, -136, -49, 2], [-26, 86, 45, -195], [-169, -89, -72], [-153, -194]]
[EX A]: [78, 86, -72, -153]

[EX Q]: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]
[EX A]: [-66, -6, 91, 69, -24, 72]

[EX Q]: [[18, -200, -7, -105], [77, 15, 68, -88, 14, 63, -23], [-14, 2, -163, -76, -93, -158], [29, -137, -133, -32, 37, -6], [79, -57, -186, -72, 55, -83, -10], [-175, -95, 45, -183, -198], [-82, -18, -62, 60, -37, -88], [-91, -24, -23, 18, 52, 26, 84]]
[EX A]:
[18, 77, 2, 37, 79, 45, 60, 84]