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]: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]
[EX A]: [85, -8, 67, 45, 71, 91]

[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]: [[12, -143, -153, -19, -136, -106], [-160, 34, 58, -113, -177], [64, -57], [-11, -183], [-193, -145, 81, 86, -177, -102, -41], [-147, -34, -60, 33, -135], [-74, 41], [-44, 96, -11, -155, 72, -21, 9]]
[EX A]:
[12, 58, 64, -11, 86, 33, 41, 96]