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: [[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]

A: [-12, 8, 76, 96, -36]
****
Q: [[-128, -167, 12, -33, -120], [-16, -175], [-97, 34, -3, 41, -72], [50, 39, -128, -26, -96, -58]]

A: [12, -16, 41, 50]
****
Q: [[-105, 16, -118, -91], [-67, 19], [-178, -6], [-186, -162, 39, -103, 66, -75], [45, -84, -118, 87, -112, 18], [-167, -15, -126, -156], [-142, -199], [23, -11]]

A:
[16, 19, -6, 66, 87, -15, -142, 23]
****