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: [[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]

A: [83, 48, 83, 53, 35, -103]
****
Q: [[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]

A: [-19, -24, 93, -55, 52, 96, -22]
****
Q: [[-50, -12, -80, -46, -80, -82], [-76, -3, -125, -152, 80, -192, -138], [28, -200, -118]]

A:
[-12, 80, 28]
****