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.

[EX Q]: [[-61, -130, -161, 8, -36, 53, -21], [-30, 55, -48, -10, -25, -183, -1], [-92, 93], [-144, -105, -78, 90, -32], [-87, -168, -25, 75, -48, -51, -86], [10, -17, 6]]
[EX A]: [53, 55, 93, 90, 75, 10]

[EX Q]: [[-163, -60, 37, -195, -36, 3], [-32, 75, -1]]
[EX A]: [37, 75]

[EX Q]: [[-193, -34, -120], [-173, -86, -54, 100, 37, -74], [-3, 82, -119, 24, -2, 3, -54], [-128, -182, 49, -178], [-140, 34, 17, -146, -193, 65], [21, -133]]
[EX A]:
[-34, 100, 82, 49, 65, 21]