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: [[-148, 31, -194, 43, -103, -187, -150], [10, -3, 85, -57], [-102, 39, -179, -125, 49]]

A: [43, 85, 49]
****
Q: [[-105, -7, 11, -135], [-148, -166, 11], [-160, -67, 35], [38, -54, -108, 82, 46, -10], [-82, -177, -194, -95, -75, -86, 48], [-52, -21, 47, 41, -120, 95], [-181, -142, 2, -18, -34], [0, -148], [-115, -151]]

A: [11, 11, 35, 82, 48, 95, 2, 0, -115]
****
Q: [[-142, -185, -30, 21], [80, -170, 37], [-182, 85, -168, 17, -91, -63, -134], [51, -182, -169, -146, 81, -141], [-181, -2]]

A:
[21, 80, 85, 81, -2]
****