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: [[65, -15, -148, -148, 54, -90, 34], [53, -170], [-98, 19, -4, 72, 10, 64, -82], [-30, -32], [-62, -61, 85, -166], [-61, 38, -158, 12, -70]]

A: [65, 53, 72, -30, 85, 38]
****
Q: [[-91, 65, -182, -89, -129, 10, 64], [-65, 7, 2, 67, -160], [-176, -15, -177, 98, -49, -7], [-138, 46, -133, -190, -46, -187, 47], [76, 14, 42, -105, -142, -54], [-168, -16, -105, -95], [-148, 44, -18, 91, 23, -38], [56, 64, -189, -50]]

A: [65, 67, 98, 47, 76, -16, 91, 64]
****
Q: [[5, 24, 11, 13], [-95, -193, -12, 64, -28, -10], [-102, -181, -40, 93, 45], [-80, -171], [-42, -37], [-134, -51, -178, 28, -33, -75, -196]]

A:
[24, 64, 93, -80, -37, 28]
****