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: [[-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: [[85, -28, -180, -71, 2], [-115, -8, -40], [67, -109, -131, -27, -24, -119], [-16, 45, 25], [-135, -11, 29, -67, 71], [-66, -101, -181, -180, 91, -72, -153]]

A: [85, -8, 67, 45, 71, 91]
****
Q: [[-55, -170, -150], [-25, -27, -133, 72, 45], [-180, -111], [44, -23, -73, -104, 8, 85], [-143, -69, -17, 31], [-36, -143, -144], [-38, -63, 62, -42], [-41, -102, -91, -97, -20]]

A:
[-55, 72, -111, 85, 31, -36, 62, -20]
****