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: [[-194, -30, -77, -21], [35, 86], [-189, -19, 29, -169, -32, -38, -25], [100, -144, 85]]

A: [-21, 86, 29, 100]
****
Q: [[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]

A: [52, 39, 95, 2, -17, 57, 73, 70, 44]
****
Q: [[66, 14, -174], [-164, -50, 27, -50, -41, 72, 38], [-54, -57, -129], [-200, -63, -184, 21, 68], [-33, -15, -179]]

A:
[66, 72, -54, 68, -15]
****