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: [[36, 35], [-130, -104, -27, 40, 69, -115], [-26, 66, -66, 16], [-23, 79, 51, -13]]

A: [36, 69, 66, 79]
****
Q: [[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]

A: [9, -5, 62, -35, 92, -30, 91]
****
Q: [[-90, -120, -137], [-26, -49, -172, -164, -81], [-36, -98, 11], [-39, -30, -83, 96, 46, -114]]

A:
[-90, -26, 11, 96]
****