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]: [[-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]: [[79, -165], [-194, 6, 83, -87, -88, -184, -92], [-179, 2, -143, -1, -42, -195, 25], [-49, 75, -89, -5], [-107, 97, -50, -13, 98], [14, 76, -55, 3, 28, 8, 92], [-50, 84, 52, -149, -27, 31], [92, 82, 17], [-155, -74, 28, 9, 5, -101, -121]]
[EX A]: [79, 83, 25, 75, 98, 92, 84, 92, 28]

[EX Q]: [[-164, 71, 3, 18, 11], [100, 1, 34, -110, -13, 51], [32, 76, -19, 60], [-26, -152, -140, 73], [-160, -187, -93], [-153, -75, -138, -50, 13, -116]]
[EX A]:
[71, 100, 76, 73, -93, 13]