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, 63, 24, -49, -66, 81], [-36, -61, -108], [35, -115], [-24, -143, 65, -63], [-104, 59, -120, -187, 27, -102, 36], [-105, -31, -128, -167, -109], [32, -148, -76, 33, -190, -89], [47, -56, 89, -35, -137, -2, 43], [98, 11, 48, -66, -84, -60]]
[EX A]: [81, -36, 35, 65, 59, -31, 33, 89, 98]

[EX Q]: [[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]
[EX A]: [97, 23, -2, 61, 62, 68, 12, 15]

[EX Q]: [[-62, 42, -188, -36, -124, -116, -85], [-191, -139, -18, -67], [-140, 40, -2, 25, -5, -92, -49], [47, -95, 29, -53, -153, -64, -10], [-121, 68, -143], [-100, -113, -64, 18, 58, -30, -139], [-119, 76, -135, -149]]
[EX A]:
[42, -18, 40, 47, 68, 58, 76]