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]: [[57, 1, -116, -74, 72, -86], [-19, -44, -181, 89, -174, 39, 96], [-170, -82, -59, 83]]
[EX A]: [72, 96, 83]

[EX Q]: [[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]
[EX A]: [43, 11, 11, 58, 21, 100, 25]

[EX Q]: [[37, -170, 87, -193, -197], [66, 36, 53, -175], [-160, -2, -168, -139, -150, -77], [-15, -147, -184], [-88, 60, 97, 95, 90], [-64, -93, -148, -168, 88, 7, 53], [-50, 9, 90, -87], [-164, -14], [-11, -46, 42, -60, -161]]
[EX A]:
[87, 66, -2, -15, 97, 88, 90, -14, 42]