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]: [[-4, -117, -177, -28, -87, -48], [-168, -118, 18, 12, -108, 83, -91]]
[EX A]: [-4, 83]

[EX Q]: [[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]
[EX A]: [-2, 31, 57, 0, 55, 94, 49, 57, 9]

[EX Q]: [[32, 56, -97, -33, 60, 97], [35, -146], [-80, -96, -6, 68, -182, -139, -115], [-72, 57, -50, -78], [45, -36, 59, -142, -27, -14, -165]]
[EX A]:
[97, 35, 68, 57, 59]