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: [[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]

A: [99, 68, -32]
****
Q: [[-75, -110, -13, -96, 22], [-199, -154, 9], [-80, -160], [-90, 65, -167, -77, -28]]

A: [22, 9, -80, 65]
****
Q: [[-106, -184], [19, 55], [35, -42, -85, 98], [77, -74, -136, -167, 71, -195], [95, -17, 4, 10, -135, 79, -24], [64, -195, -16, -193, 100]]

A:
[-106, 55, 98, 77, 95, 100]
****