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]: [[53, -12], [-42, -18, 64], [-34, -130, -92], [92, -31], [22, -53], [-42, -23, 82, -4, 39, 36, -162], [-185, 85, -116, 21, -177], [-176, 81, -105, 9, -39, 34, -140], [-51, 30, -36, 43, -179]]
[EX A]: [53, 64, -34, 92, 22, 82, 85, 81, 43]

[EX Q]: [[-102, 46, -150, -150], [-151, -137]]
[EX A]: [46, -137]

[EX Q]: [[84, -40, -12, -169, -101, -139, -189], [-125, -146, 96, -88, 83, -88, -191], [-59, 24], [-22, -162, -37, -162, -151], [-196, 71], [-116, 25, -112, -168], [68, 83, -35, -74, -111, 55], [-128, -56, 97, -38, -155], [50, -103, -153, -84]]
[EX A]:
[84, 96, 24, -22, 71, 25, 83, 97, 50]