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]: [[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]
[EX A]: [98, 57, 95, 99, 87, 76]

[EX Q]: [[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]
[EX A]: [-135, 19, -152, -91, 22, -152]

[EX Q]: [[91, -34, 63], [10, -130, 82, 21, 45], [-115, 18, -41, -36, -96], [-147, 46, -124, -139], [-173, -23, 37, -171, -65, -21, -42], [-191, -172, -147, 17, -27, -124], [19, 46], [-46, -174, 74]]
[EX A]:
[91, 82, 18, 46, 37, 17, 46, 74]