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: [[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]

A: [76, 41, 90, 32, 39]
****
Q: [[15, 55, -12, -150, -97, -99], [51, -194, 44], [-80, -77, 61, 83], [13, -197, 61, -137, -41], [-116, -161, -9, -68], [-190, -182, 67, -78], [-69, -122, -119, 15, 12]]

A: [55, 51, 83, 61, -9, 67, 15]
****
Q: [[-101, 63], [53, 27, -169, -121, -154, -48], [-99, -20, 91, 68], [-176, -5, 89, -82, -62, 67], [7, -120, -199, -64]]

A:
[63, 53, 91, 89, 7]
****