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]: [[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]
[EX A]: [90, -12, 100, 6]

[EX Q]: [[64, -108], [42, 76, -28, -11, 28], [-37, -188, -155, 73, -137, 29], [-159, 66, 72, 95, -81], [-176, 24], [89, -106, 36, -126, -155], [-194, 39, -96, -11]]
[EX A]: [64, 76, 73, 95, 24, 89, 39]

[EX Q]: [[26, -44, -111], [-81, -35, -175, 76, 60], [-10, -38], [17, 22, -63], [-18, -39, -133, -150, -60, -127, 86]]
[EX A]:
[26, 76, -10, 22, 86]