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: [[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

A: [18, 79, 47, 72]
****
Q: [[-110, -23, -169, 17, -26], [-173, -98, 69, 24], [-57, 55, 60, 96, -31, -136], [-68, -152, -107, 74, 75], [-122, 20, -98, 36, -48, -92], [-178, -151]]

A: [17, 69, 96, 75, 36, -151]
****
Q: [[-110, -53], [77, -94, 52], [13, -121, 27, -164], [-115, -165, -87, -81], [44, 96], [-43, -177, -153, -80, -10, 62, 34], [-92, -10, -36, -137, -123, 68, -35], [-139, -143, 63, -140]]

A:
[-53, 77, 27, -81, 96, 62, 68, 63]
****