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: [[-187, -52, -138, 33], [-32, -176, -198, -74, 66], [95, -187, 82, -51, -114]]

A: [33, 66, 95]
****
Q: [[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]

A: [-66, -6, 91, 69, -24, 72]
****
Q: [[-34, -136, -134], [-185, -198, -191, -100, -1, -43], [-95, -178, -137, 63, -136, 80], [-62, -71, -140], [62, -3, 49, -133, 82, -81, 90], [-113, -109, -183, 56, 23, 24, -82]]

A:
[-34, -1, 80, -62, 90, 56]
****