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: [[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: [[-3, -85, 99, 98, -191, -35], [-112, -171, 39, -93, 54], [32, -44, -123, -78, -171]]

A: [99, 54, 32]
****
Q: [[-195, -92, -109, -196, -153, -50, -18], [-42, -59], [54, -109, -63], [-23, 53, -185], [-51, 68, 49], [-156, 94]]

A:
[-18, -42, 54, 53, 68, 94]
****