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: [[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]

A: [52, 8, 23, 54, -147, 61, 25, -44, 92]
****
Q: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

A: [100, 84, -63, -55, 78, 58, 86, 99]
****
Q: [[-86, 20, -5], [-101, 80, -195, -89, -21, -95, -42], [28, 82, 85, 94, -40], [-118, -94, -83, -33, 28, -10, 65], [77, -122, -126], [-156, -193, 75], [-170, -27, 26, 67], [-98, -80, -73], [-151, 51, -10, -85, -38, 88, 89]]

A:
[20, 80, 94, 65, 77, 75, 67, -73, 89]
****