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]: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]
[A]: [22, 9, -80, 65]


[Q]: [[-72, -37, -51, 45], [-102, 17, -162, -122, -145], [-40, 31, -71, 89, 92, -3, 16], [-155, -190, 12, 3], [-2, -150, -94, 28, -52, 7], [-150, -106, 8], [-102, -174, -93, -186, -194]]
[A]: [45, 17, 92, 12, 28, 8, -93]


[Q]: [[64, -51, 88, -3, 7, -198, -49], [-150, 26, -82, -4, -161], [-28, -167, -178, -152, -80, 22], [-16, -169, -135], [-122, -176, 75, 29], [-90, -34], [-93, -147, -74], [67, -6, -161, -58], [46, -199, -131]]
[A]:
[88, 26, 22, -16, 75, -34, -74, 67, 46]