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]: [[-31, -48], [7, -142, -76]]
[EX A]: [-31, 7]

[EX Q]: [[-138, 20, 9, -133, -166, -153], [-71, -103], [-144, 9, -15, 2, -17, -172, -139], [97, -35, 16], [-77, -46, 46, -41, -12], [-166, -84, -193, 17, 12, -142], [-76, 90, -186]]
[EX A]: [20, -71, 9, 97, 46, 17, 90]

[EX Q]: [[-169, -24, -162, 67], [-82, 1, -188], [-177, -114, -40], [83, 46, -79, -170, -13, -68, -152], [-106, -119, -69], [37, -189, -110, -171, -63, -18]]
[EX A]:
[67, 1, -40, 83, -69, 37]