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: [[-173, -53, -182, -135, -193, -186], [-160, -98, -103], [17, -38, 36, -50, -36]]

A: [-53, -98, 36]
****
Q: [[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]

A: [-139, 92, 69, 96]
****
Q: [[-19, -2, 13, -80], [28, 78, -19, -101, -101, -13], [85, 52], [-158, -121, -14, -93, -38], [72, -194, 62, -167, -39, -23, -92], [98, 75, -92, -36, 94, 6, 94]]

A:
[13, 78, 85, -14, 72, 98]
****