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: [[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]

A: [85, 21, 34, 90, 81, 32, 77, 65, 97]
****
Q: [[-23, 34], [-9, -35, 39, -132, -43], [-195, 62, -128, -159, 62, -122, -109], [-98, 66, 28], [-48, 38], [-85, -91, -181, -129], [-125, -140, -162, -66, -2], [-196, -53, -117]]

A: [34, 39, 62, 66, 38, -85, -2, -53]
****
Q: [[-57, -146, -145], [-173, -21, -162, -40], [-72, -17, -171, -118, 43, -29], [55, 18, -195, -77]]

A:
[-57, -21, 43, 55]
****