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: [[-108, -104, -26, -89, -93, -182], [-98, -12, 74, -113], [-106, -170, -116, -138, -14, 56, -150], [-58, -175, -70, 0, -85, 71, -85]]

A: [-26, 74, 56, 71]
****
Q: [[75, -65, 73, -136, -118], [51, -185], [-115, -90, 10], [53, -191, -159, -180], [-94, -98, -180, -43], [-159, 17, -78, -186], [-198, -111]]

A: [75, 51, 10, 53, -43, 17, -111]
****
Q: [[-66, -173], [48, -186], [4, 97, -97, -139, -7], [-16, -50, 93, 67, 65], [-160, -93, 87, -37]]

A:
[-66, 48, 97, 93, 87]
****