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]: [[10, -121, -54, -1, -69, -181], [83, -37, -173, -81, -42], [-117, 86, -6, -54, -21], [-171, 22, -69]]
[EX A]: [10, 83, 86, 22]

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

[EX Q]: [[-118, -5, -53], [-115, 50, -150, 40, -83, -189, 50], [-200, -108, 38, -7, -21, -143], [-146, -22, -123, 38, -197], [-22, 89], [-63, -68, -52, -124, -68]]
[EX A]:
[-5, 50, 38, 38, 89, -52]