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: [[61, -157, 48], [29, 77, -102, -122, 50, 25, -186], [44, -84, -172, -97, -142], [-194, 62, -5, -145, 93]]

A: [61, 77, 44, 93]
****
Q: [[-112, -32, 5, -133], [-57, -42, -9, 22, 64]]

A:
[5, 64]
****