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]: [[89, -123], [-133, -92, -92, -101, 47], [19, 8, -116, -70], [-97, -36, -123]]
[EX A]: [89, 47, 19, -36]

[EX Q]: [[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]
[EX A]: [-20, -50, 86, 95]

[EX Q]: [[-89, -73, -12, 88], [12, 77, -166, -48, -147], [43, 11, -1, -163, 58, -199, -22], [71, 12, 25], [60, -195, -97, -87, 16], [47, -8, -134, -119, 100, -200, -138]]
[EX A]:
[88, 77, 58, 71, 60, 100]