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: [[100, -56, -195, -111], [-102, -4, -87, -166, -68, 84, -157], [-63, -119, -190], [-144, -55], [-103, 19, 5, 78, -135, -153], [58, 15, -108, -178], [36, 73, -175, -74, -179, 86], [29, 41, 99, -75, -22, -174]]

A: [100, 84, -63, -55, 78, 58, 86, 99]
****
Q: [[-192, 95, -12, -36, 36, -180, 51], [-140, -53, -106, -125], [-118, -29, -137, 27, -192]]

A: [95, -53, 27]
****
Q: [[8, -152, -131], [-71, 61, -173, 23, 70], [34, -9], [-179, -124, 5, 28, -74, 90], [-150, -173, -113, -53, -46, 10, 20], [-36, 75, 56, -62, -157], [80, -197, -90, -167], [-72, -23, -123], [47, -149, -126]]

A:
[8, 70, 34, 90, 20, 75, 80, -23, 47]
****