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.

Q: [[-38, 56, -23], [-19, -178, -59]]

A: [56, -19]
****
Q: [[-15, -180, -24], [-18, -77], [-167, -37, -37], [97, 80], [-91, 18, -122, -8, 90, -125, -162], [96, 74, -57, 89, -171], [66, -113]]

A: [-15, -18, -37, 97, 90, 96, 66]
****
Q: [[-33, -36], [4, -194, -200], [-108, -92, -34, -57, -58, -157, 41], [-169, -132, -176, -64], [-2, -181, 96, -83, -7, -52, -48], [28, -46, -13, 97], [41, -153, -168, 100, 39, -200], [-162, -114]]

A:
[-33, 4, 41, -64, 96, 97, 100, -114]
****