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]: [[-19, -69, -153, -73], [-136, -112, -133], [30, -31], [59, -147, -105, 23, 54], [49, -59, 65, -41, -42, 22], [-133, -88, -102, -7], [-16, -96, -138, -48, -52], [-95, 86, -35, 37, 59, -151], [39, -117, -124, -196]]
[EX A]: [-19, -112, 30, 59, 65, -7, -16, 86, 39]

[EX Q]: [[-58, 41, -14, -59, -168, -150, 61], [-110, -158, 28], [-109, 5, -79, -55, 95, -140], [8, -194, 9, -19, -121]]
[EX A]: [61, 28, 95, 9]

[EX Q]: [[-139, -47, 11, -49, -55, 82], [25, -105, -25, 31, 9, -16, 6], [-30, 9, 48, -110, -157]]
[EX A]:
[82, 31, 48]