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]: [[-6, 41, -190], [-47, 89], [29, -17, -135]]
[EX A]: [41, 89, 29]

[EX Q]: [[-18, -69, 27, -166, -146, -169], [-11, -183, -102, -104, -33, 65, -19], [-27, -147], [-41, -126, -9, -125], [-28, -26], [-33, -92]]
[EX A]: [27, 65, -27, -9, -26, -33]

[EX Q]: [[-20, 23, -68, -166, -69, -60, 48], [-91, -33, 39, 6, 92, -111, -133], [-151, -28, 28, 36, -48], [-17, -101, 78], [-79, -103, -115, -140, -132, 90]]
[EX A]:
[48, 92, 36, 78, 90]