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]: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]
[EX A]: [-53, -98, 36]

[EX Q]: [[25, 22, 14, -95], [-48, -20, -187, 29, -172, -188, 54], [-66, -45], [64, 76, -182, 0, 79, 30], [21, -174, 96, -43, 23]]
[EX A]: [25, 54, -45, 79, 96]

[EX Q]: [[-167, -5, -112], [-127, 70, -13, -143], [-152, 15, 14, -75, -53, -87, 60], [-36, 17, -6, -167, -66, 16], [-182, 94, -95], [-181, -70, 31, 37], [-104, -13, -30, -177, -139, -77], [-177, 80, -33, -70], [100, -87, -104, -37, 31, -103, -149]]
[EX A]:
[-5, 70, 60, 17, 94, 37, -13, 80, 100]