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]: [[-76, -194, 15, 74], [-60, -20, 6], [-118, -40, 82], [-135, 13], [10, -24, -119, -62, -109], [0, 5]]
[EX A]: [74, 6, 82, 13, 10, 5]

[EX Q]: [[-9, 61, 5, -18, 76, 64], [-40, -62, -195, -168], [-178, 87, -197], [-34, -55, -24, -22, -106, -115, 30], [11, 6, -129, -164, -110, -136, 27], [-122, -113, -133, 27], [4, 51, -48, 2]]
[EX A]: [76, -40, 87, 30, 27, 27, 51]

[EX Q]: [[55, -194, -189, -72, -147, -30], [56, -8, -190, -123, -89, -59, -62], [12, -55, -119, 4, -28, -18]]
[EX A]:
[55, 56, 12]