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]: [[-27, 12], [-33, -163, -183, -45, -110, -33, -10], [-186, -48], [-35, -145, -161]]
[EX A]: [12, -10, -48, -35]

[EX Q]: [[-73, 76, -100, -143], [-74, -141], [73, -82, -103, -88, 70, -159, -124], [-110, -78, 44, 57, -61], [41, -83, -173, -44, -181]]
[EX A]: [76, -74, 73, 57, 41]

[EX Q]: [[-63, 87, -136, -58], [-42, -167, -47, 16, -175, 22], [-189, 77, -39, 44, -181, 56, -155], [36, 97, -7, -147, 29], [91, -156, 69, -139, 69, 53, -68], [-10, -41, -99, -65, 52, -42, -18]]
[EX A]:
[87, 22, 77, 97, 91, 52]