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: [[-92, -149], [-178, -95, 30, 90], [8, -122, -101, -194, -47, -192], [74, -174, -102, 37, -119, -102], [-135, -136, -126], [-186, -117, 6], [7, -114, -109, -31, -103, -61], [-147, -86, -163]]

A: [-92, 90, 8, 74, -126, 6, 7, -86]
****
Q: [[-106, 10, 60], [-32, -143], [-139, -187, -193, 68], [40, -29, 93, -179, -66, -190, 24], [24, -72], [-111, -130, -98, -114, -138, -87, 26], [-54, -151, 7], [20, -64, 85]]

A: [60, -32, 68, 93, 24, 26, 7, 85]
****
Q: [[32, -164, 28, -112, -120, -44, -15], [-19, -63, -185], [-65, -165, 97, -37]]

A:
[32, -19, 97]
****