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]: [[-22, -69, -38, -9, -92, 36], [-169, -140, -163, 86], [10, -73, -36], [-124, 53, 81, -61, 65, -184, -170], [69, -177, -73], [-112, 41, -38], [91, 31, 85, -72, -93, -48, 66], [-73, -180, 34, 16, -175, -28]]
[EX A]: [36, 86, 10, 81, 69, 41, 91, 34]

[EX Q]: [[86, -31, -176, -88, -177, -127, -143], [27, -44, 46, -174, -181, -86, -88], [-128, -161], [44, 81, -78, -184, -78, -146], [-72, -77, -159, 40, -30], [67, -160, -133, -91, -197]]
[EX A]: [86, 46, -128, 81, 40, 67]

[EX Q]: [[48, 71, -112, 27, 31], [-182, -71, -171, -200], [-35, 75, 3, 25, -80, -147]]
[EX A]:
[71, -71, 75]