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]: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]
[EX A]: [36, 69, 66, 79]

[EX Q]: [[91, -82, -158, -188], [-148, -168, 25, 53], [-87, 82], [-176, -136, -24, -72, -9, -12]]
[EX A]: [91, 53, 82, -9]

[EX Q]: [[11, 87, -130, 32, -160, 16], [94, 17, 30, -86, 3, 64], [30, 0, 45, 48], [51, -105], [-47, -6, -88, -81, -72, -142, -94], [99, 78]]
[EX A]:
[87, 94, 48, 51, -6, 99]