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]: [[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
[EX A]: [49, 34, 10, 52, 78, 31, 30, 18]

[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]: [[0, -47, -85, 85, -132, -171], [-135, -191], [-70, -62, 36, 78], [-163, -173, -142, -127, -49, -45], [-35, -168, -197, 12, 58, -73, -139], [-151, -11, 12, 10, -24, -114, -25], [-103, -80]]
[EX A]:
[85, -135, 78, -45, 58, 12, -80]