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]: [[-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]: [[-110, -173], [12, 37, -136, -70, -108], [-114, 0, -48, -74], [24, -48, -112, -166, -21, -28]]
[EX A]: [-110, 37, 0, 24]

[EX Q]: [[-198, -146, -175, -62, 44, 55, -46], [20, -158], [-77, 28, -47, -193], [-45, 94, -118, -139, 71, -29, -143], [-188, -167, 38, 82]]
[EX A]:
[55, 20, 28, 94, 82]