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: [[-106, 56, 90, 76, 6, -169], [-10, -187, 27, 59, 94, 85]]

A: [90, 94]
****
Q: [[-88, -73, 65, 51, -100], [-75, -195], [-115, 4, -152, -151, -65, 95, 85]]

A: [65, -75, 95]
****
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]
****