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: [[-145, -140, -7, -47, -28, -158], [-15, -2, 91, 64, 43, -22, -33], [-165, 31, -25, 46, -178, -168, 93], [-146, -51, 86], [-107, 39, -154, -156, -33], [-89, -36, -35, -106], [-21, 28, -165, 23, -81, 74, -138], [-45, -28, 72, -140, -87], [17, -83]]

A: [-7, 91, 93, 86, 39, -35, 74, 72, 17]
****
Q: [[-45, 39, 37, 4], [68, -44, 26, 94], [-98, -15, -9, -140], [-73, 23, -72], [20, 53, -23, -25, -81], [92, -5, 57], [72, 39, -80], [-75, -120, 15], [13, 38, -63, -164]]

A: [39, 94, -9, 23, 53, 92, 72, 15, 38]
****
Q: [[63, -180, -118, 17, -13, -92], [-60, -49, 19, 70, 55, 75, 71], [-30, 23, -109, -184, -195, -19, -165], [-171, -51, -7, -125, -111, -167, 72], [72, 31, -125, -34, -138]]

A:
[63, 75, 23, 72, 72]
****