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: [[-123, -135, -68], [-5, 30, -61, -105, -111], [70, 99, -198, 44, -10, 73], [-3, -54, 15, -79, -84, -4, -94]]

A: [-68, 30, 99, 15]
****
Q: [[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]

A: [95, 47, 66, 75, 33, 72, 9]
****
Q: [[-119, 97, 45, 19, -111, -13, -181], [-74, 23, -81, -96, -51, -14]]

A:
[97, 23]
****