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]: [[67, 44, 35, 59], [-191, -183, -154, 76, -98, -165], [50, 63], [72, 30]]
[EX A]: [67, 76, 63, 72]

[EX Q]: [[-16, -54, -63, 93, -162, -89], [68, -135], [96, -48], [94, -86, 22, -98, -95, 31], [81, -15, -150, -108, -34, 29], [-17, 67, 71, 14]]
[EX A]: [93, 68, 96, 94, 81, 71]

[EX Q]: [[58, -72, -74], [-76, -150], [-64, -91, -115, -196], [-127, 54, -137, -165, -163, -32, -33]]
[EX A]:
[58, -76, -64, 54]