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]: [[15, -109, -144], [-76, 24, -172]]
[EX A]: [15, 24]

[EX Q]: [[-44, -145, 83, -107, -25], [-86, 59, -176, 37, 50, 36, -129], [-22, 55, 65, 57, -9], [56, -191], [83, -160, 43], [-59, 76, -121, -152, 99, -87, 93], [-152, -119, 98, -89, -180], [-79, -11, 11, -44, 15, -180, -121], [24, -33, -179, -111, 82]]
[EX A]: [83, 59, 65, 56, 83, 99, 98, 15, 82]

[EX Q]: [[-57, 89, -25, 69], [-9, -94], [-37, -193, 51], [-16, 76, 65, 68, -171], [-193, 36, -158, -110, -65], [-157, -6, -85, -142, -177], [10, -18, -174, -16, -113, 21]]
[EX A]:
[89, -9, 51, 76, 36, -6, 21]